./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/protection-local/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i ./goblint.2024-09-02_08-21-23.files/protection-local/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.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-24 10:01:35,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 10:01:35,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-24 10:01:35,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 10:01:35,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 10:01:35,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 10:01:35,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 10:01:35,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 10:01:35,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 10:01:35,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 10:01:35,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 10:01:35,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 10:01:35,861 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 10:01:35,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 10:01:35,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 10:01:35,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 10:01:35,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 10:01:35,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 10:01:35,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 10:01:35,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 10:01:35,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 10:01:35,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 10:01:35,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 10:01:35,866 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 10:01:35,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 10:01:35,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 10:01:35,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 10:01:35,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 10:01:35,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 10:01:35,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 10:01:35,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 10:01:35,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 10:01:35,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 10:01:35,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 10:01:35,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 10:01:35,870 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-24 10:01:35,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 10:01:35,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 10:01:35,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-24 10:01:35,871 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-24 10:01:35,871 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-24 10:01:35,872 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-24 10:01:36,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 10:01:36,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 10:01:36,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 10:01:36,102 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-24 10:01:36,102 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-24 10:01:36,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-local/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.yml/witness.yml [2024-09-24 10:01:36,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 10:01:36,242 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 10:01:36,243 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-09-24 10:01:37,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 10:01:37,874 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 10:01:37,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-09-24 10:01:37,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/749c03439/096569114b834faab95813081fec0166/FLAG443b67bfc [2024-09-24 10:01:37,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/749c03439/096569114b834faab95813081fec0166 [2024-09-24 10:01:37,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 10:01:37,906 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-24 10:01:37,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 10:01:37,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 10:01:37,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 10:01:37,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 10:01:36" (1/2) ... [2024-09-24 10:01:37,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ccfd6d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 10:01:37, skipping insertion in model container [2024-09-24 10:01:37,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 10:01:36" (1/2) ... [2024-09-24 10:01:37,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@68dbad94 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 10:01:37, skipping insertion in model container [2024-09-24 10:01:37,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:01:37" (2/2) ... [2024-09-24 10:01:37,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ccfd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:37, skipping insertion in model container [2024-09-24 10:01:37,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:01:37" (2/2) ... [2024-09-24 10:01:38,061 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-24 10:01:38,062 INFO L1541 ArrayList]: Location invariant before [L790-L790] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,062 INFO L1541 ArrayList]: Location invariant before [L771-L771] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,062 INFO L1541 ArrayList]: Location invariant before [L774-L774] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,062 INFO L1541 ArrayList]: Location invariant before [L754-L754] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,062 INFO L1541 ArrayList]: Location invariant before [L740-L740] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,063 INFO L1541 ArrayList]: Location invariant before [L828-L828] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,063 INFO L1541 ArrayList]: Location invariant before [L821-L821] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,063 INFO L1541 ArrayList]: Location invariant before [L751-L751] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,063 INFO L1541 ArrayList]: Location invariant before [L817-L817] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,063 INFO L1541 ArrayList]: Location invariant before [L761-L761] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,063 INFO L1541 ArrayList]: Location invariant before [L768-L768] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,063 INFO L1541 ArrayList]: Location invariant before [L797-L797] (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1) [2024-09-24 10:01:38,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 10:01:38,295 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2024-09-24 10:01:38,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 10:01:38,469 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 10:01:38,479 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] 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 Start Parsing Local [2024-09-24 10:01:38,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 10:01:38,629 INFO L204 MainTranslator]: Completed translation [2024-09-24 10:01:38,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38 WrapperNode [2024-09-24 10:01:38,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 10:01:38,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 10:01:38,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 10:01:38,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 10:01:38,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,681 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2024-09-24 10:01:38,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 10:01:38,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 10:01:38,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 10:01:38,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 10:01:38,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 10:01:38,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 10:01:38,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 10:01:38,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 10:01:38,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (1/1) ... [2024-09-24 10:01:38,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 10:01:38,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 10:01:38,757 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-24 10:01:38,760 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-24 10:01:38,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-24 10:01:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 10:01:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-24 10:01:38,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-24 10:01:38,810 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-24 10:01:38,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-24 10:01:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-24 10:01:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-24 10:01:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 10:01:38,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 10:01:38,813 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-24 10:01:38,938 INFO L242 CfgBuilder]: Building ICFG [2024-09-24 10:01:38,940 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 10:01:39,371 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-24 10:01:39,372 INFO L291 CfgBuilder]: Performing block encoding [2024-09-24 10:01:39,680 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 10:01:39,681 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-24 10:01:39,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:01:39 BoogieIcfgContainer [2024-09-24 10:01:39,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 10:01:39,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 10:01:39,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 10:01:39,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 10:01:39,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 10:01:36" (1/4) ... [2024-09-24 10:01:39,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afdd0bd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 24.09 10:01:39, skipping insertion in model container [2024-09-24 10:01:39,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 10:01:37" (2/4) ... [2024-09-24 10:01:39,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afdd0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:01:39, skipping insertion in model container [2024-09-24 10:01:39,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:01:38" (3/4) ... [2024-09-24 10:01:39,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afdd0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:01:39, skipping insertion in model container [2024-09-24 10:01:39,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:01:39" (4/4) ... [2024-09-24 10:01:39,692 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2024-09-24 10:01:39,708 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 10:01:39,709 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-09-24 10:01:39,709 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-24 10:01:39,776 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-24 10:01:39,819 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 10:01:39,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 10:01:39,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 10:01:39,821 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-24 10:01:39,823 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-24 10:01:39,856 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 10:01:39,867 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-09-24 10:01:39,874 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;@43fafc3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 10:01:39,874 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-24 10:01:40,043 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 2 more)] === [2024-09-24 10:01:40,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:40,048 INFO L85 PathProgramCache]: Analyzing trace with hash -257866810, now seen corresponding path program 1 times [2024-09-24 10:01:40,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:40,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592485558] [2024-09-24 10:01:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:40,800 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-24 10:01:40,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:40,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592485558] [2024-09-24 10:01:40,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592485558] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:40,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:40,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-24 10:01:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981369665] [2024-09-24 10:01:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:40,808 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 10:01:40,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:40,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 10:01:40,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 10:01:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:40,837 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:40,838 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-24 10:01:40,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:40,984 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 10:01:40,984 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 2 more)] === [2024-09-24 10:01:40,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash 596063924, now seen corresponding path program 1 times [2024-09-24 10:01:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:40,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946925318] [2024-09-24 10:01:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:41,276 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-24 10:01:41,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:41,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946925318] [2024-09-24 10:01:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946925318] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:41,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:41,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 10:01:41,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662795092] [2024-09-24 10:01:41,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:41,278 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 10:01:41,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:41,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 10:01:41,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-24 10:01:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:41,280 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:41,280 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:41,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:41,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:41,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:41,701 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 10:01:41,701 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 2 more)] === [2024-09-24 10:01:41,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:41,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1298112904, now seen corresponding path program 1 times [2024-09-24 10:01:41,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:41,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844607973] [2024-09-24 10:01:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:42,110 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-24 10:01:42,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:42,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844607973] [2024-09-24 10:01:42,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844607973] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:42,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:42,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 10:01:42,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627614523] [2024-09-24 10:01:42,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:42,111 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 10:01:42,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:42,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 10:01:42,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-24 10:01:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:42,115 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:42,115 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-24 10:01:42,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:42,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:42,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:43,729 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 10:01:43,729 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 2 more)] === [2024-09-24 10:01:43,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:43,729 INFO L85 PathProgramCache]: Analyzing trace with hash 454574631, now seen corresponding path program 1 times [2024-09-24 10:01:43,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:43,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909590772] [2024-09-24 10:01:43,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:43,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:44,081 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-24 10:01:44,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:44,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909590772] [2024-09-24 10:01:44,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909590772] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:44,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:44,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 10:01:44,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511856401] [2024-09-24 10:01:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:44,083 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 10:01:44,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:44,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 10:01:44,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 10:01:44,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:44,085 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:44,085 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:44,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:44,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:44,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:44,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:44,254 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-24 10:01:44,254 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 2 more)] === [2024-09-24 10:01:44,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1592055640, now seen corresponding path program 1 times [2024-09-24 10:01:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:44,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347047433] [2024-09-24 10:01:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:44,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:46,084 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-24 10:01:46,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:46,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347047433] [2024-09-24 10:01:46,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347047433] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:46,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:46,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 10:01:46,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508820162] [2024-09-24 10:01:46,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:46,087 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 10:01:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:46,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 10:01:46,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-24 10:01:46,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:46,090 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:46,090 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-24 10:01:46,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:46,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:46,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:46,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:46,091 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:46,625 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-24 10:01:46,625 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 2 more)] === [2024-09-24 10:01:46,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1009433936, now seen corresponding path program 1 times [2024-09-24 10:01:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:46,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764914983] [2024-09-24 10:01:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:47,109 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-24 10:01:47,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:47,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764914983] [2024-09-24 10:01:47,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764914983] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:47,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:47,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 10:01:47,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356174968] [2024-09-24 10:01:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:47,110 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 10:01:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:47,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 10:01:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-24 10:01:47,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:47,112 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:47,112 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-24 10:01:47,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:47,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:47,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:47,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:47,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:47,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:47,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:01:47,388 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-24 10:01:47,388 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 2 more)] === [2024-09-24 10:01:47,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1227681388, now seen corresponding path program 1 times [2024-09-24 10:01:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:47,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297149843] [2024-09-24 10:01:47,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:47,931 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-24 10:01:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297149843] [2024-09-24 10:01:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297149843] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:47,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:47,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 10:01:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206506752] [2024-09-24 10:01:47,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:47,933 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 10:01:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:47,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 10:01:47,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-24 10:01:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:47,934 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:47,934 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:47,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:47,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:47,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:47,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:47,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:47,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:01:47,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:48,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:01:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:48,282 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-24 10:01:48,282 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 2 more)] === [2024-09-24 10:01:48,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:48,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1314187932, now seen corresponding path program 2 times [2024-09-24 10:01:48,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:48,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676835272] [2024-09-24 10:01:48,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:48,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:49,646 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-24 10:01:49,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:49,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676835272] [2024-09-24 10:01:49,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676835272] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:49,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:49,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-24 10:01:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004382984] [2024-09-24 10:01:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:49,648 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 10:01:49,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 10:01:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-24 10:01:49,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:49,649 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:49,649 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-24 10:01:49,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:49,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:49,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:49,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:49,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:49,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:01:49,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:49,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:49,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:49,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:01:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 10:01:49,998 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 5 remaining) [2024-09-24 10:01:49,998 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-09-24 10:01:50,002 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-09-24 10:01:50,002 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 5 remaining) [2024-09-24 10:01:50,002 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 5 remaining) [2024-09-24 10:01:50,002 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-24 10:01:50,011 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-09-24 10:01:50,013 INFO L312 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/3) [2024-09-24 10:01:50,017 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 10:01:50,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 10:01:50,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 10:01:50,036 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-24 10:01:50,037 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-24 10:01:50,040 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 10:01:50,040 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 10:01:50,041 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;@43fafc3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 10:01:50,041 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-24 10:01:50,156 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-24 10:01:50,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1298110802, now seen corresponding path program 1 times [2024-09-24 10:01:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:50,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225574630] [2024-09-24 10:01:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:50,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:50,428 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-24 10:01:50,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:50,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225574630] [2024-09-24 10:01:50,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225574630] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:50,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 10:01:50,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462886728] [2024-09-24 10:01:50,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:50,430 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 10:01:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:50,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 10:01:50,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 10:01:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:50,431 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:50,431 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:50,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:50,552 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-24 10:01:50,552 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-24 10:01:50,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1586792640, now seen corresponding path program 1 times [2024-09-24 10:01:50,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:50,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629688] [2024-09-24 10:01:50,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:50,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:50,729 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-24 10:01:50,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:50,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629688] [2024-09-24 10:01:50,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629688] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:50,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:50,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 10:01:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712364493] [2024-09-24 10:01:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:50,732 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 10:01:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 10:01:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-24 10:01:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:50,733 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:50,733 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:50,985 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-24 10:01:50,986 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-24 10:01:50,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1945996948, now seen corresponding path program 1 times [2024-09-24 10:01:50,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:50,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638038771] [2024-09-24 10:01:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:51,246 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-24 10:01:51,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:51,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638038771] [2024-09-24 10:01:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638038771] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:51,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 10:01:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85246390] [2024-09-24 10:01:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:51,247 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 10:01:51,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:51,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 10:01:51,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-24 10:01:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:51,248 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:51,248 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-24 10:01:51,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:51,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:51,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:51,549 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-24 10:01:51,549 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:01:51,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash -206605116, now seen corresponding path program 1 times [2024-09-24 10:01:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205662281] [2024-09-24 10:01:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:52,149 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-24 10:01:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205662281] [2024-09-24 10:01:52,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205662281] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:52,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:52,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 10:01:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546033260] [2024-09-24 10:01:52,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:52,151 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 10:01:52,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:52,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 10:01:52,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-24 10:01:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:52,152 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:52,152 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:52,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:52,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:52,481 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-24 10:01:52,481 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:01:52,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash -732636348, now seen corresponding path program 1 times [2024-09-24 10:01:52,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:52,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009964237] [2024-09-24 10:01:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:52,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:52,657 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-24 10:01:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009964237] [2024-09-24 10:01:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009964237] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 10:01:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245346757] [2024-09-24 10:01:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:52,658 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 10:01:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 10:01:52,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 10:01:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:52,659 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:52,659 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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-24 10:01:52,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:52,993 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-24 10:01:52,993 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:01:52,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1844494843, now seen corresponding path program 1 times [2024-09-24 10:01:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:52,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139688369] [2024-09-24 10:01:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:52,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:53,804 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-24 10:01:53,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:53,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139688369] [2024-09-24 10:01:53,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139688369] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:53,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:53,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-24 10:01:53,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438567104] [2024-09-24 10:01:53,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:53,806 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-24 10:01:53,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:53,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-24 10:01:53,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-09-24 10:01:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:53,807 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:53,807 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:53,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:53,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:53,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:53,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:53,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:53,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:53,970 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-24 10:01:53,970 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:01:53,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:53,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1564701237, now seen corresponding path program 1 times [2024-09-24 10:01:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534350108] [2024-09-24 10:01:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:54,299 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-24 10:01:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534350108] [2024-09-24 10:01:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534350108] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:54,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:54,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-24 10:01:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718132384] [2024-09-24 10:01:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:54,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 10:01:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 10:01:54,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-09-24 10:01:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:54,301 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:54,301 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:54,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:54,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:54,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:54,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:54,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:54,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:54,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 10:01:55,084 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-24 10:01:55,084 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-24 10:01:55,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -911523541, now seen corresponding path program 2 times [2024-09-24 10:01:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049713182] [2024-09-24 10:01:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:56,080 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-24 10:01:56,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:56,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049713182] [2024-09-24 10:01:56,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049713182] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:56,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:56,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-24 10:01:56,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965494519] [2024-09-24 10:01:56,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:56,082 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-24 10:01:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:56,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-24 10:01:56,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-24 10:01:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:56,083 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:56,083 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:56,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:56,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:56,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:56,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:56,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:56,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:56,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 10:01:56,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 10:01:56,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:56,340 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-24 10:01:56,340 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-24 10:01:56,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:56,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1824689573, now seen corresponding path program 2 times [2024-09-24 10:01:56,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:56,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652418187] [2024-09-24 10:01:56,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:56,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:56,602 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-24 10:01:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652418187] [2024-09-24 10:01:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652418187] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:56,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:56,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-24 10:01:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493911818] [2024-09-24 10:01:56,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:56,603 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 10:01:56,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:56,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 10:01:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-24 10:01:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:56,603 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:56,603 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:56,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:56,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:56,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:56,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:56,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:56,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:56,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-24 10:01:56,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:56,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:57,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 10:01:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:57,320 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-24 10:01:57,320 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:01:57,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:57,321 INFO L85 PathProgramCache]: Analyzing trace with hash -309619707, now seen corresponding path program 3 times [2024-09-24 10:01:57,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:57,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396927172] [2024-09-24 10:01:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:01:58,162 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-24 10:01:58,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:01:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396927172] [2024-09-24 10:01:58,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396927172] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:01:58,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:01:58,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-24 10:01:58,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373584725] [2024-09-24 10:01:58,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:01:58,164 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-24 10:01:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:01:58,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-24 10:01:58,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-09-24 10:01:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:58,165 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:01:58,165 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-24 10:01:58,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:58,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:58,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:58,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:58,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:58,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:58,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-24 10:01:58,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:58,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:58,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:01:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:01:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 10:01:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:01:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:01:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 10:01:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 10:01:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 10:01:58,541 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-24 10:01:58,541 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:01:58,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:01:58,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1453639733, now seen corresponding path program 3 times [2024-09-24 10:01:58,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:01:58,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666168653] [2024-09-24 10:01:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:01:58,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:01:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 10:01:58,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 10:01:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 10:01:58,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-24 10:01:58,640 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 10:01:58,640 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-09-24 10:01:58,640 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-09-24 10:01:58,641 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-09-24 10:01:58,641 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-09-24 10:01:58,641 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-09-24 10:01:58,641 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-09-24 10:01:58,641 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-24 10:01:58,644 INFO L408 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2024-09-24 10:01:58,644 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-09-24 10:01:58,715 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-24 10:01:58,719 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 10:01:58,721 INFO L469 ceAbstractionStarter]: Automizer considered 12 witness invariants [2024-09-24 10:01:58,721 INFO L470 ceAbstractionStarter]: WitnessConsidered=12 [2024-09-24 10:01:58,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 10:01:58 BasicIcfg [2024-09-24 10:01:58,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-24 10:01:58,723 INFO L158 Benchmark]: Toolchain (without parser) took 20816.39ms. Allocated memory was 138.4MB in the beginning and 645.9MB in the end (delta: 507.5MB). Free memory was 79.3MB in the beginning and 468.5MB in the end (delta: -389.2MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2024-09-24 10:01:58,723 INFO L158 Benchmark]: Witness Parser took 0.22ms. Allocated memory is still 138.4MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 10:01:58,723 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 138.4MB. Free memory was 90.6MB in the beginning and 90.5MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 10:01:58,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 721.78ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 79.3MB in the beginning and 140.9MB in the end (delta: -61.6MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-09-24 10:01:58,724 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.74ms. Allocated memory is still 192.9MB. Free memory was 140.9MB in the beginning and 137.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 10:01:58,724 INFO L158 Benchmark]: Boogie Preprocessor took 35.05ms. Allocated memory is still 192.9MB. Free memory was 137.7MB in the beginning and 135.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 10:01:58,724 INFO L158 Benchmark]: RCFGBuilder took 965.64ms. Allocated memory is still 192.9MB. Free memory was 135.6MB in the beginning and 143.7MB in the end (delta: -8.0MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-09-24 10:01:58,725 INFO L158 Benchmark]: TraceAbstraction took 19037.12ms. Allocated memory was 192.9MB in the beginning and 645.9MB in the end (delta: 453.0MB). Free memory was 143.7MB in the beginning and 468.5MB in the end (delta: -324.9MB). Peak memory consumption was 130.2MB. Max. memory is 16.1GB. [2024-09-24 10:01:58,726 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.22ms. Allocated memory is still 138.4MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.75ms. Allocated memory is still 138.4MB. Free memory was 90.6MB in the beginning and 90.5MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 721.78ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 79.3MB in the beginning and 140.9MB in the end (delta: -61.6MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.74ms. Allocated memory is still 192.9MB. Free memory was 140.9MB in the beginning and 137.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.05ms. Allocated memory is still 192.9MB. Free memory was 137.7MB in the beginning and 135.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 965.64ms. Allocated memory is still 192.9MB. Free memory was 135.6MB in the beginning and 143.7MB in the end (delta: -8.0MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19037.12ms. Allocated memory was 192.9MB in the beginning and 645.9MB in the end (delta: 453.0MB). Free memory was 143.7MB in the beginning and 468.5MB in the end (delta: -324.9MB). Peak memory consumption was 130.2MB. 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: 2720, independent: 2337, independent conditional: 1535, independent unconditional: 802, dependent: 383, dependent conditional: 369, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2378, independent: 2337, independent conditional: 1535, independent unconditional: 802, dependent: 41, dependent conditional: 27, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2378, independent: 2337, independent conditional: 1535, independent unconditional: 802, dependent: 41, dependent conditional: 27, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2468, independent: 2337, independent conditional: 1535, independent unconditional: 802, dependent: 131, dependent conditional: 117, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2468, independent: 2337, independent conditional: 32, independent unconditional: 2305, dependent: 131, dependent conditional: 55, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2468, independent: 2337, independent conditional: 32, independent unconditional: 2305, dependent: 131, dependent conditional: 55, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 833, independent: 811, independent conditional: 9, independent unconditional: 802, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 833, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 276, dependent conditional: 0, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 276, independent: 254, independent conditional: 9, independent unconditional: 245, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 276, independent: 254, independent conditional: 9, independent unconditional: 245, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2304, independent: 1982, independent conditional: 86, independent unconditional: 1896, dependent: 322, dependent conditional: 156, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2468, independent: 1526, independent conditional: 23, independent unconditional: 1503, dependent: 109, dependent conditional: 47, dependent unconditional: 62, unknown: 833, unknown conditional: 17, unknown unconditional: 816] , Statistics on independence cache: Total cache size (in pairs): 833, Positive cache size: 811, Positive conditional cache size: 9, Positive unconditional cache size: 802, Negative cache size: 22, Negative conditional cache size: 8, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1565, Maximal queried relation: 4, Independence queries for same thread: 342, Persistent sets #1 benchmarks: Persistent set computation time: 2.1s, Number of persistent set computation: 101, Number of trivial persistent sets: 64, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 816, independent: 802, independent conditional: 0, independent unconditional: 802, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2720, independent: 2337, independent conditional: 1535, independent unconditional: 802, dependent: 383, dependent conditional: 369, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2378, independent: 2337, independent conditional: 1535, independent unconditional: 802, dependent: 41, dependent conditional: 27, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2378, independent: 2337, independent conditional: 1535, independent unconditional: 802, dependent: 41, dependent conditional: 27, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2468, independent: 2337, independent conditional: 1535, independent unconditional: 802, dependent: 131, dependent conditional: 117, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2468, independent: 2337, independent conditional: 32, independent unconditional: 2305, dependent: 131, dependent conditional: 55, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2468, independent: 2337, independent conditional: 32, independent unconditional: 2305, dependent: 131, dependent conditional: 55, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 833, independent: 811, independent conditional: 9, independent unconditional: 802, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 833, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 276, dependent conditional: 0, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 276, independent: 254, independent conditional: 9, independent unconditional: 245, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 276, independent: 254, independent conditional: 9, independent unconditional: 245, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2304, independent: 1982, independent conditional: 86, independent unconditional: 1896, dependent: 322, dependent conditional: 156, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2468, independent: 1526, independent conditional: 23, independent unconditional: 1503, dependent: 109, dependent conditional: 47, dependent unconditional: 62, unknown: 833, unknown conditional: 17, unknown unconditional: 816] , Statistics on independence cache: Total cache size (in pairs): 833, Positive cache size: 811, Positive conditional cache size: 9, Positive unconditional cache size: 802, Negative cache size: 22, Negative conditional cache size: 8, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1565, Maximal queried relation: 4, Independence queries for same thread: 342 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3379, independent: 2840, independent conditional: 2066, independent unconditional: 774, dependent: 539, dependent conditional: 526, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2891, independent: 2840, independent conditional: 2066, independent unconditional: 774, dependent: 51, dependent conditional: 38, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2891, independent: 2840, independent conditional: 2066, independent unconditional: 774, dependent: 51, dependent conditional: 38, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3161, independent: 2840, independent conditional: 2066, independent unconditional: 774, dependent: 321, dependent conditional: 308, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3161, independent: 2840, independent conditional: 40, independent unconditional: 2800, dependent: 321, dependent conditional: 230, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3161, independent: 2840, independent conditional: 40, independent unconditional: 2800, dependent: 321, dependent conditional: 230, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 819, independent: 777, independent conditional: 3, independent unconditional: 774, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 819, independent: 539, independent conditional: 0, independent unconditional: 539, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 280, independent: 238, independent conditional: 3, independent unconditional: 235, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 280, independent: 238, independent conditional: 3, independent unconditional: 235, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1659, independent: 1246, independent conditional: 7, independent unconditional: 1239, dependent: 413, dependent conditional: 324, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3161, independent: 2063, independent conditional: 37, independent unconditional: 2026, dependent: 279, dependent conditional: 201, dependent unconditional: 78, unknown: 819, unknown conditional: 32, unknown unconditional: 787] , Statistics on independence cache: Total cache size (in pairs): 819, Positive cache size: 777, Positive conditional cache size: 3, Positive unconditional cache size: 774, Negative cache size: 42, Negative conditional cache size: 29, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2104, Maximal queried relation: 5, Independence queries for same thread: 488, Persistent sets #1 benchmarks: Persistent set computation time: 1.4s, Number of persistent set computation: 159, Number of trivial persistent sets: 96, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 787, independent: 774, independent conditional: 0, independent unconditional: 774, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3379, independent: 2840, independent conditional: 2066, independent unconditional: 774, dependent: 539, dependent conditional: 526, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2891, independent: 2840, independent conditional: 2066, independent unconditional: 774, dependent: 51, dependent conditional: 38, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2891, independent: 2840, independent conditional: 2066, independent unconditional: 774, dependent: 51, dependent conditional: 38, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3161, independent: 2840, independent conditional: 2066, independent unconditional: 774, dependent: 321, dependent conditional: 308, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3161, independent: 2840, independent conditional: 40, independent unconditional: 2800, dependent: 321, dependent conditional: 230, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3161, independent: 2840, independent conditional: 40, independent unconditional: 2800, dependent: 321, dependent conditional: 230, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 819, independent: 777, independent conditional: 3, independent unconditional: 774, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 819, independent: 539, independent conditional: 0, independent unconditional: 539, dependent: 280, dependent conditional: 0, dependent unconditional: 280, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 280, independent: 238, independent conditional: 3, independent unconditional: 235, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 280, independent: 238, independent conditional: 3, independent unconditional: 235, dependent: 42, dependent conditional: 29, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1659, independent: 1246, independent conditional: 7, independent unconditional: 1239, dependent: 413, dependent conditional: 324, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3161, independent: 2063, independent conditional: 37, independent unconditional: 2026, dependent: 279, dependent conditional: 201, dependent unconditional: 78, unknown: 819, unknown conditional: 32, unknown unconditional: 787] , Statistics on independence cache: Total cache size (in pairs): 819, Positive cache size: 777, Positive conditional cache size: 3, Positive unconditional cache size: 774, Negative cache size: 42, Negative conditional cache size: 29, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2104, Maximal queried relation: 5, Independence queries for same thread: 488 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L740] 1 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L751] 1 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L751] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L768] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L771] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L797] 2 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L799] 2 return 0; [L754] 1 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L761] 1 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L817] 0 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 //@ assert ((((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))); [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305=-2, t306=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - 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, 70 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 4.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: 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, 5.6s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 2241 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, 70 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 3.7s, 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: 66, 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, 4.5s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-24 10:01:58,765 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-24 10:01:58,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-09-24 10:01:59,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE