./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/protection-ghost/mix000.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c091e2ee Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i ./goblint.2024-08-08_07-59-58.files/protection-ghost/mix000.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m [2024-08-14 04:21:17,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-14 04:21:17,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-14 04:21:17,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-14 04:21:17,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-14 04:21:17,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-14 04:21:17,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-14 04:21:17,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-14 04:21:17,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-14 04:21:17,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-14 04:21:17,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-14 04:21:17,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-14 04:21:17,539 INFO L153 SettingsManager]: * Use SBE=true [2024-08-14 04:21:17,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-14 04:21:17,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-14 04:21:17,540 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-14 04:21:17,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-14 04:21:17,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-14 04:21:17,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-14 04:21:17,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-14 04:21:17,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-14 04:21:17,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-14 04:21:17,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-14 04:21:17,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-14 04:21:17,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-14 04:21:17,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-14 04:21:17,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-14 04:21:17,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-14 04:21:17,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-14 04:21:17,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-14 04:21:17,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 04:21:17,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-14 04:21:17,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-14 04:21:17,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-14 04:21:17,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-14 04:21:17,552 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-14 04:21:17,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-14 04:21:17,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-14 04:21:17,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-14 04:21:17,553 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-14 04:21:17,553 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-14 04:21:17,554 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-14 04:21:17,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-08-14 04:21:17,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-14 04:21:17,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-14 04:21:17,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-14 04:21:17,845 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-14 04:21:17,846 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-14 04:21:17,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/protection-ghost/mix000.opt.yml/witness.yml [2024-08-14 04:21:18,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-14 04:21:18,022 INFO L274 PluginConnector]: CDTParser initialized [2024-08-14 04:21:18,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-08-14 04:21:19,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-14 04:21:19,810 INFO L384 CDTParser]: Found 1 translation units. [2024-08-14 04:21:19,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-08-14 04:21:19,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fa5cdfc3d/c172f7f7f86d45f2a46cd64c1034e7ca/FLAG3591816ee [2024-08-14 04:21:20,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fa5cdfc3d/c172f7f7f86d45f2a46cd64c1034e7ca [2024-08-14 04:21:20,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-14 04:21:20,136 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-14 04:21:20,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-14 04:21:20,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-14 04:21:20,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-14 04:21:20,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 04:21:18" (1/2) ... [2024-08-14 04:21:20,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f84a895 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:20, skipping insertion in model container [2024-08-14 04:21:20,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 04:21:18" (1/2) ... [2024-08-14 04:21:20,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72a21fe7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:20, skipping insertion in model container [2024-08-14 04:21:20,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 04:21:20" (2/2) ... [2024-08-14 04:21:20,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f84a895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20, skipping insertion in model container [2024-08-14 04:21:20,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 04:21:20" (2/2) ... [2024-08-14 04:21:20,147 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-14 04:21:20,216 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-14 04:21:20,217 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] ((((((((((((((((! multithreaded || x$r_buff0_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1)) [2024-08-14 04:21:20,218 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] ((((((((((((((((! multithreaded || x$r_buff0_thd1 == (_Bool)0) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1)) [2024-08-14 04:21:20,218 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-08-14 04:21:20,218 INFO L106 edCorrectnessWitness]: ghost_update [L827-L827] multithreaded = 1; [2024-08-14 04:21:20,271 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-14 04:21:20,451 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] [2024-08-14 04:21:20,623 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 04:21:20,647 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-14 04:21:20,688 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i[987,1000] Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-14 04:21:20,772 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-14 04:21:20,816 INFO L206 MainTranslator]: Completed translation [2024-08-14 04:21:20,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20 WrapperNode [2024-08-14 04:21:20,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-14 04:21:20,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-14 04:21:20,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-14 04:21:20,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-14 04:21:20,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,897 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-08-14 04:21:20,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-14 04:21:20,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-14 04:21:20,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-14 04:21:20,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-14 04:21:20,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-14 04:21:20,955 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-14 04:21:20,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-14 04:21:20,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-14 04:21:20,956 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (1/1) ... [2024-08-14 04:21:20,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-14 04:21:20,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 04:21:20,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-14 04:21:21,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-14 04:21:21,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-14 04:21:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-14 04:21:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-08-14 04:21:21,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-08-14 04:21:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-08-14 04:21:21,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-08-14 04:21:21,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-14 04:21:21,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-14 04:21:21,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-14 04:21:21,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-14 04:21:21,032 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-08-14 04:21:21,211 INFO L244 CfgBuilder]: Building ICFG [2024-08-14 04:21:21,213 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-14 04:21:21,592 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-08-14 04:21:21,593 INFO L293 CfgBuilder]: Performing block encoding [2024-08-14 04:21:21,805 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-14 04:21:21,805 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-14 04:21:21,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 04:21:21 BoogieIcfgContainer [2024-08-14 04:21:21,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-14 04:21:21,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-14 04:21:21,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-14 04:21:21,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-14 04:21:21,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 04:21:18" (1/4) ... [2024-08-14 04:21:21,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10966743 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 04:21:21, skipping insertion in model container [2024-08-14 04:21:21,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 04:21:20" (2/4) ... [2024-08-14 04:21:21,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10966743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 04:21:21, skipping insertion in model container [2024-08-14 04:21:21,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:20" (3/4) ... [2024-08-14 04:21:21,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10966743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 04:21:21, skipping insertion in model container [2024-08-14 04:21:21,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 04:21:21" (4/4) ... [2024-08-14 04:21:21,822 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2024-08-14 04:21:21,842 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-14 04:21:21,842 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-08-14 04:21:21,842 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-14 04:21:21,887 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-14 04:21:21,930 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 04:21:21,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 04:21:21,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 04:21:21,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-14 04:21:21,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-14 04:21:21,980 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 04:21:21,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-08-14 04:21:22,002 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3486ecc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 04:21:22,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-14 04:21:22,152 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-14 04:21:22,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 04:21:22,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2032576853, now seen corresponding path program 1 times [2024-08-14 04:21:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 04:21:22,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840673323] [2024-08-14 04:21:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 04:21:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 04:21:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 04:21:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 04:21:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 04:21:22,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840673323] [2024-08-14 04:21:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840673323] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 04:21:22,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 04:21:22,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-14 04:21:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982478541] [2024-08-14 04:21:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 04:21:22,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 04:21:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 04:21:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 04:21:22,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 04:21:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:22,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 04:21:22,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 04:21:22,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:23,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-14 04:21:23,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-14 04:21:23,342 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-14 04:21:23,346 INFO L308 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE (1/2) [2024-08-14 04:21:23,349 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 04:21:23,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-14 04:21:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-14 04:21:23,368 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-08-14 04:21:23,370 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-08-14 04:21:23,375 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-14 04:21:23,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-14 04:21:23,377 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3486ecc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-14 04:21:23,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-08-14 04:21:23,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-14 04:21:23,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 04:21:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash 345507155, now seen corresponding path program 1 times [2024-08-14 04:21:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 04:21:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574599526] [2024-08-14 04:21:23,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 04:21:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 04:21:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 04:21:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 04:21:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 04:21:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574599526] [2024-08-14 04:21:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574599526] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 04:21:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 04:21:23,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-14 04:21:23,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984723921] [2024-08-14 04:21:23,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 04:21:23,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 04:21:23,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 04:21:23,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 04:21:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 04:21:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:23,922 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 04:21:23,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 04:21:23,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:23,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:23,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-14 04:21:23,991 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-14 04:21:23,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 04:21:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash 903774416, now seen corresponding path program 1 times [2024-08-14 04:21:23,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 04:21:23,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930980940] [2024-08-14 04:21:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 04:21:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 04:21:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 04:21:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 04:21:24,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 04:21:24,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930980940] [2024-08-14 04:21:24,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930980940] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 04:21:24,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 04:21:24,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-08-14 04:21:24,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734888453] [2024-08-14 04:21:24,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 04:21:24,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-14 04:21:24,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 04:21:24,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-14 04:21:24,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-14 04:21:24,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:24,120 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 04:21:24,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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-08-14 04:21:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:24,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-14 04:21:24,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-14 04:21:24,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 04:21:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1456840237, now seen corresponding path program 1 times [2024-08-14 04:21:24,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 04:21:24,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116718849] [2024-08-14 04:21:24,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 04:21:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 04:21:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 04:21:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 04:21:26,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 04:21:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116718849] [2024-08-14 04:21:26,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116718849] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 04:21:26,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 04:21:26,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-14 04:21:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024080014] [2024-08-14 04:21:26,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 04:21:26,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 04:21:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 04:21:26,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 04:21:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-08-14 04:21:26,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:26,291 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 04:21:26,292 INFO L496 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-08-14 04:21:26,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:26,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:26,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:26,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 04:21:26,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-14 04:21:26,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-14 04:21:26,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 04:21:26,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1615717707, now seen corresponding path program 1 times [2024-08-14 04:21:26,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 04:21:26,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480809252] [2024-08-14 04:21:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 04:21:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 04:21:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 04:21:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 04:21:26,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 04:21:26,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480809252] [2024-08-14 04:21:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480809252] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 04:21:26,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 04:21:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-08-14 04:21:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119747523] [2024-08-14 04:21:26,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 04:21:26,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-08-14 04:21:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 04:21:26,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-08-14 04:21:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-08-14 04:21:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:26,712 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 04:21:26,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 04:21:26,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:26,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:26,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 04:21:26,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:26,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 04:21:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 04:21:26,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-14 04:21:26,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-14 04:21:26,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 04:21:26,889 INFO L85 PathProgramCache]: Analyzing trace with hash 657447336, now seen corresponding path program 1 times [2024-08-14 04:21:26,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 04:21:26,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110798707] [2024-08-14 04:21:26,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 04:21:26,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 04:21:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 04:21:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-14 04:21:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 04:21:28,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110798707] [2024-08-14 04:21:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110798707] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 04:21:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 04:21:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-14 04:21:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986529822] [2024-08-14 04:21:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 04:21:28,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-14 04:21:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 04:21:28,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-14 04:21:28,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-08-14 04:21:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:28,044 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 04:21:28,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 04:21:28,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:28,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:28,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 04:21:28,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 04:21:28,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 04:21:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 04:21:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 04:21:28,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-14 04:21:28,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-14 04:21:28,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 04:21:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2013793044, now seen corresponding path program 2 times [2024-08-14 04:21:28,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 04:21:28,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276474095] [2024-08-14 04:21:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 04:21:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 04:21:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-14 04:21:29,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-08-14 04:21:29,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-14 04:21:29,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276474095] [2024-08-14 04:21:29,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276474095] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-14 04:21:29,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-14 04:21:29,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-14 04:21:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096919836] [2024-08-14 04:21:29,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-14 04:21:29,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-14 04:21:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-14 04:21:29,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-14 04:21:29,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-08-14 04:21:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:29,431 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-14 04:21:29,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-14 04:21:29,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:29,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:29,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-14 04:21:29,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-08-14 04:21:29,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-14 04:21:29,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-14 04:21:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-14 04:21:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-14 04:21:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-08-14 04:21:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-14 04:21:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-08-14 04:21:29,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-14 04:21:29,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-08-14 04:21:29,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-14 04:21:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1253258040, now seen corresponding path program 3 times [2024-08-14 04:21:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-14 04:21:29,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67395427] [2024-08-14 04:21:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-14 04:21:29,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-14 04:21:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 04:21:30,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-14 04:21:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-14 04:21:30,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-14 04:21:30,119 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-14 04:21:30,119 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-08-14 04:21:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-08-14 04:21:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-08-14 04:21:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-08-14 04:21:30,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-08-14 04:21:30,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-14 04:21:30,122 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-08-14 04:21:30,123 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-08-14 04:21:30,126 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-14 04:21:30,126 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-14 04:21:30,193 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-08-14 04:21:30,193 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-08-14 04:21:30,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 04:21:30 BasicIcfg [2024-08-14 04:21:30,197 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-14 04:21:30,197 INFO L158 Benchmark]: Toolchain (without parser) took 10061.07ms. Allocated memory was 151.0MB in the beginning and 385.9MB in the end (delta: 234.9MB). Free memory was 88.3MB in the beginning and 313.3MB in the end (delta: -224.9MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-08-14 04:21:30,198 INFO L158 Benchmark]: Witness Parser took 0.31ms. Allocated memory is still 151.0MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 04:21:30,198 INFO L158 Benchmark]: CDTParser took 1.11ms. Allocated memory is still 151.0MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 04:21:30,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 680.50ms. Allocated memory is still 151.0MB. Free memory was 87.7MB in the beginning and 53.5MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-08-14 04:21:30,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.53ms. Allocated memory is still 151.0MB. Free memory was 53.5MB in the beginning and 50.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 04:21:30,199 INFO L158 Benchmark]: Boogie Preprocessor took 52.38ms. Allocated memory is still 151.0MB. Free memory was 50.6MB in the beginning and 48.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-14 04:21:30,200 INFO L158 Benchmark]: RCFGBuilder took 850.71ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 48.5MB in the beginning and 123.1MB in the end (delta: -74.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-14 04:21:30,200 INFO L158 Benchmark]: TraceAbstraction took 8387.33ms. Allocated memory was 205.5MB in the beginning and 385.9MB in the end (delta: 180.4MB). Free memory was 122.2MB in the beginning and 313.3MB in the end (delta: -191.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-14 04:21:30,202 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.31ms. Allocated memory is still 151.0MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 1.11ms. Allocated memory is still 151.0MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 680.50ms. Allocated memory is still 151.0MB. Free memory was 87.7MB in the beginning and 53.5MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.53ms. Allocated memory is still 151.0MB. Free memory was 53.5MB in the beginning and 50.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.38ms. Allocated memory is still 151.0MB. Free memory was 50.6MB in the beginning and 48.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 850.71ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 48.5MB in the beginning and 123.1MB in the end (delta: -74.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8387.33ms. Allocated memory was 205.5MB in the beginning and 385.9MB in the end (delta: 180.4MB). Free memory was 122.2MB in the beginning and 313.3MB in the end (delta: -191.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 908, independent: 804, independent conditional: 411, independent unconditional: 393, dependent: 104, dependent conditional: 69, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 891, independent: 804, independent conditional: 411, independent unconditional: 393, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 891, independent: 804, independent conditional: 411, independent unconditional: 393, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 978, independent: 804, independent conditional: 35, independent unconditional: 769, dependent: 174, dependent conditional: 52, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 978, independent: 804, independent conditional: 35, independent unconditional: 769, dependent: 174, dependent conditional: 42, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 978, independent: 804, independent conditional: 35, independent unconditional: 769, dependent: 174, dependent conditional: 42, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 443, independent: 398, independent conditional: 3, independent unconditional: 395, dependent: 45, dependent conditional: 7, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 443, independent: 381, independent conditional: 0, independent unconditional: 381, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 3, independent unconditional: 14, dependent: 45, dependent conditional: 7, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 3, independent unconditional: 14, dependent: 45, dependent conditional: 7, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 576, independent: 176, independent conditional: 35, independent unconditional: 141, dependent: 401, dependent conditional: 72, dependent unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 978, independent: 406, independent conditional: 32, independent unconditional: 374, dependent: 129, dependent conditional: 35, dependent unconditional: 94, unknown: 443, unknown conditional: 10, unknown unconditional: 433] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 398, Positive conditional cache size: 3, Positive unconditional cache size: 395, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 95, Number of trivial persistent sets: 65, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 428, independent: 393, independent conditional: 0, independent unconditional: 393, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 908, independent: 804, independent conditional: 411, independent unconditional: 393, dependent: 104, dependent conditional: 69, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 891, independent: 804, independent conditional: 411, independent unconditional: 393, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 891, independent: 804, independent conditional: 411, independent unconditional: 393, dependent: 87, dependent conditional: 52, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 978, independent: 804, independent conditional: 35, independent unconditional: 769, dependent: 174, dependent conditional: 52, dependent unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 978, independent: 804, independent conditional: 35, independent unconditional: 769, dependent: 174, dependent conditional: 42, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 978, independent: 804, independent conditional: 35, independent unconditional: 769, dependent: 174, dependent conditional: 42, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 443, independent: 398, independent conditional: 3, independent unconditional: 395, dependent: 45, dependent conditional: 7, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 443, independent: 381, independent conditional: 0, independent unconditional: 381, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 3, independent unconditional: 14, dependent: 45, dependent conditional: 7, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 3, independent unconditional: 14, dependent: 45, dependent conditional: 7, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 576, independent: 176, independent conditional: 35, independent unconditional: 141, dependent: 401, dependent conditional: 72, dependent unconditional: 329, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 978, independent: 406, independent conditional: 32, independent unconditional: 374, dependent: 129, dependent conditional: 35, dependent unconditional: 94, unknown: 443, unknown conditional: 10, unknown unconditional: 433] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 398, Positive conditional cache size: 3, Positive unconditional cache size: 395, Negative cache size: 45, Negative conditional cache size: 7, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 820, independent: 736, independent conditional: 431, independent unconditional: 305, dependent: 84, dependent conditional: 52, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 788, independent: 736, independent conditional: 431, independent unconditional: 305, dependent: 52, dependent conditional: 20, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 788, independent: 736, independent conditional: 431, independent unconditional: 305, dependent: 52, dependent conditional: 20, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 870, independent: 736, independent conditional: 11, independent unconditional: 725, dependent: 134, dependent conditional: 71, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 870, independent: 736, independent conditional: 11, independent unconditional: 725, dependent: 134, dependent conditional: 50, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 870, independent: 736, independent conditional: 11, independent unconditional: 725, dependent: 134, dependent conditional: 50, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 362, independent: 313, independent conditional: 6, independent unconditional: 307, dependent: 49, dependent conditional: 17, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 362, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 49, dependent conditional: 17, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 49, dependent conditional: 17, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 434, independent: 104, independent conditional: 19, independent unconditional: 85, dependent: 330, dependent conditional: 114, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 870, independent: 423, independent conditional: 5, independent unconditional: 418, dependent: 85, dependent conditional: 33, dependent unconditional: 52, unknown: 362, unknown conditional: 23, unknown unconditional: 339] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 313, Positive conditional cache size: 6, Positive unconditional cache size: 307, Negative cache size: 49, Negative conditional cache size: 17, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 4, Independence queries for same thread: 32 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 94, Number of trivial persistent sets: 57, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 337, independent: 305, independent conditional: 0, independent unconditional: 305, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 820, independent: 736, independent conditional: 431, independent unconditional: 305, dependent: 84, dependent conditional: 52, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 788, independent: 736, independent conditional: 431, independent unconditional: 305, dependent: 52, dependent conditional: 20, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 788, independent: 736, independent conditional: 431, independent unconditional: 305, dependent: 52, dependent conditional: 20, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 870, independent: 736, independent conditional: 11, independent unconditional: 725, dependent: 134, dependent conditional: 71, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 870, independent: 736, independent conditional: 11, independent unconditional: 725, dependent: 134, dependent conditional: 50, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 870, independent: 736, independent conditional: 11, independent unconditional: 725, dependent: 134, dependent conditional: 50, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 362, independent: 313, independent conditional: 6, independent unconditional: 307, dependent: 49, dependent conditional: 17, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 362, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 68, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 49, dependent conditional: 17, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 68, independent: 19, independent conditional: 6, independent unconditional: 13, dependent: 49, dependent conditional: 17, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 434, independent: 104, independent conditional: 19, independent unconditional: 85, dependent: 330, dependent conditional: 114, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 870, independent: 423, independent conditional: 5, independent unconditional: 418, dependent: 85, dependent conditional: 33, dependent unconditional: 52, unknown: 362, unknown conditional: 23, unknown unconditional: 339] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 313, Positive conditional cache size: 6, Positive unconditional cache size: 307, Negative cache size: 49, Negative conditional cache size: 17, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 4, Independence queries for same thread: 32 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L829] 0 //@ assert (((((((((((((((((!multithreaded || (x$r_buff0_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))); [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L830] 0 //@ assert (((((((((((((((((!multithreaded || (x$r_buff0_thd1 == (_Bool) 0)) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L813] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-2, t1=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 829]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: 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, 56 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.8s, 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: 3, 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.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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, 56 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 44, 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.8s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 1908 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-14 04:21:30,242 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-08-14 04:21:30,440 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-08-14 04:21:30,642 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