./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/protection-ghost/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-09-02_08-21-23.files/protection-ghost/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 13:50:50,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 13:50:50,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 13:50:50,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 13:50:50,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 13:50:50,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 13:50:50,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 13:50:50,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 13:50:50,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 13:50:50,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 13:50:50,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 13:50:50,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 13:50:50,940 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 13:50:50,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 13:50:50,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 13:50:50,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 13:50:50,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 13:50:50,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 13:50:50,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 13:50:50,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 13:50:50,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 13:50:50,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 13:50:50,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 13:50:50,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 13:50:50,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 13:50:50,947 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 13:50:50,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 13:50:50,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 13:50:50,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 13:50:50,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 13:50:50,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 13:50:50,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 13:50:50,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 13:50:50,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 13:50:50,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 13:50:50,949 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 13:50:50,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 13:50:50,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 13:50:50,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 13:50:50,952 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 13:50:50,952 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 13:50:50,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-08 13:50:51,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 13:50:51,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 13:50:51,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 13:50:51,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 13:50:51,240 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 13:50:51,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-09-08 13:50:52,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 13:50:52,883 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 13:50:52,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-09-08 13:50:52,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4f4e72274/a3bc46b6a9c44668add910cd14e3631e/FLAGea03dbfe0 [2024-09-08 13:50:53,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4f4e72274/a3bc46b6a9c44668add910cd14e3631e [2024-09-08 13:50:53,222 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 13:50:53,223 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 13:50:53,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-ghost/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-09-08 13:50:53,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 13:50:53,323 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 13:50:53,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 13:50:53,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 13:50:53,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 13:50:53,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:50:53" (1/2) ... [2024-09-08 13:50:53,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b748cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:50:53, skipping insertion in model container [2024-09-08 13:50:53,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:50:53" (1/2) ... [2024-09-08 13:50:53,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d24fa68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:50:53, skipping insertion in model container [2024-09-08 13:50:53,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 01:50:53" (2/2) ... [2024-09-08 13:50:53,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b748cd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53, skipping insertion in model container [2024-09-08 13:50:53,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 01:50:53" (2/2) ... [2024-09-08 13:50:53,400 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 13:50:53,401 INFO L1541 ArrayList]: Location invariant before [L809-L809] (((((((((((((! multithreaded || y$r_buff1_thd2 == (_Bool)0) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) [2024-09-08 13:50:53,401 INFO L1541 ArrayList]: Location invariant before [L808-L808] (((((((((((((! multithreaded || y$r_buff1_thd2 == (_Bool)0) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) [2024-09-08 13:50:53,401 INFO L1541 ArrayList]: ghost_variable multithreaded = 0 [2024-09-08 13:50:53,402 INFO L1541 ArrayList]: ghost_update [L806-L806] multithreaded = 1; [2024-09-08 13:50:53,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 13:50:53,672 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2024-09-08 13:50:53,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 13:50:53,838 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-08 13:50:53,871 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/mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-08 13:50:53,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 13:50:53,994 INFO L204 MainTranslator]: Completed translation [2024-09-08 13:50:53,994 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53 WrapperNode [2024-09-08 13:50:53,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 13:50:53,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 13:50:53,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 13:50:53,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 13:50:54,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,041 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2024-09-08 13:50:54,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 13:50:54,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 13:50:54,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 13:50:54,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 13:50:54,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 13:50:54,079 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 13:50:54,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 13:50:54,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 13:50:54,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (1/1) ... [2024-09-08 13:50:54,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 13:50:54,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 13:50:54,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-08 13:50:54,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-08 13:50:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 13:50:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 13:50:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-08 13:50:54,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-08 13:50:54,173 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-08 13:50:54,173 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-08 13:50:54,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 13:50:54,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 13:50:54,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 13:50:54,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 13:50:54,175 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 13:50:54,314 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 13:50:54,316 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 13:50:54,637 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 13:50:54,637 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 13:50:54,798 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 13:50:54,799 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-08 13:50:54,799 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:50:54 BoogieIcfgContainer [2024-09-08 13:50:54,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 13:50:54,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 13:50:54,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 13:50:54,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 13:50:54,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:50:53" (1/4) ... [2024-09-08 13:50:54,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c26036c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:50:54, skipping insertion in model container [2024-09-08 13:50:54,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 01:50:53" (2/4) ... [2024-09-08 13:50:54,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c26036c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 01:50:54, skipping insertion in model container [2024-09-08 13:50:54,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:50:53" (3/4) ... [2024-09-08 13:50:54,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c26036c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 01:50:54, skipping insertion in model container [2024-09-08 13:50:54,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:50:54" (4/4) ... [2024-09-08 13:50:54,811 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-09-08 13:50:54,829 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 13:50:54,829 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-08 13:50:54,829 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 13:50:54,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 13:50:54,921 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 13:50:54,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 13:50:54,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 13:50:54,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 13:50:54,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-08 13:50:54,965 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 13:50:54,979 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 13:50:54,987 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9d53d28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 13:50:54,987 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-08 13:50:55,093 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:50:55,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:50:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash 310316312, now seen corresponding path program 1 times [2024-09-08 13:50:55,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:50:55,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782631933] [2024-09-08 13:50:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:50:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:50:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:50:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:50:55,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:50:55,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782631933] [2024-09-08 13:50:55,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782631933] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:50:55,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:50:55,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 13:50:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961504163] [2024-09-08 13:50:55,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:50:55,902 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 13:50:55,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:50:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 13:50:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 13:50:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:50:55,931 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:50:55,932 INFO L475 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-09-08 13:50:55,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:50:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:50:56,218 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 13:50:56,218 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:50:56,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:50:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1750756840, now seen corresponding path program 1 times [2024-09-08 13:50:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:50:56,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268016442] [2024-09-08 13:50:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:50:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:50:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:50:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:50:58,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:50:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268016442] [2024-09-08 13:50:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268016442] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:50:58,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:50:58,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-08 13:50:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264205508] [2024-09-08 13:50:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:50:58,469 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 13:50:58,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:50:58,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 13:50:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-08 13:50:58,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:50:58,472 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:50:58,472 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 13:50:58,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:50:58,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:50:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:50:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 13:50:58,777 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 13:50:58,777 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:50:58,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:50:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash 872316850, now seen corresponding path program 1 times [2024-09-08 13:50:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:50:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875267483] [2024-09-08 13:50:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:50:58,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:50:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:50:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:50:59,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:50:59,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875267483] [2024-09-08 13:50:59,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875267483] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:50:59,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:50:59,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 13:50:59,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821794275] [2024-09-08 13:50:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:50:59,031 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 13:50:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:50:59,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 13:50:59,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-08 13:50:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:50:59,032 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:50:59,033 INFO L475 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-09-08 13:50:59,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:50:59,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 13:50:59,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:50:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:50:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 13:50:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:50:59,289 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 13:50:59,289 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:50:59,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:50:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1688509514, now seen corresponding path program 1 times [2024-09-08 13:50:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:50:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64289225] [2024-09-08 13:50:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:50:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:50:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:50:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:50:59,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:50:59,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64289225] [2024-09-08 13:50:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64289225] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:50:59,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:50:59,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 13:50:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035304358] [2024-09-08 13:50:59,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:50:59,601 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 13:50:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:50:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 13:50:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 13:50:59,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:50:59,603 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:50:59,603 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 13:50:59,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:50:59,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 13:50:59,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:50:59,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:00,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 13:51:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:00,258 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-08 13:51:00,258 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:00,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:00,259 INFO L85 PathProgramCache]: Analyzing trace with hash -688298458, now seen corresponding path program 1 times [2024-09-08 13:51:00,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:00,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921807638] [2024-09-08 13:51:00,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:51:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:51:00,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:51:00,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921807638] [2024-09-08 13:51:00,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921807638] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:51:00,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:51:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 13:51:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364128220] [2024-09-08 13:51:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:51:00,715 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 13:51:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:51:00,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 13:51:00,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-08 13:51:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:00,717 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:51:00,717 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 13:51:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 13:51:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:00,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:00,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 13:51:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:01,266 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 13:51:01,266 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:01,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash -503455434, now seen corresponding path program 2 times [2024-09-08 13:51:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:01,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892749747] [2024-09-08 13:51:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:01,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:51:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:51:01,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:51:01,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892749747] [2024-09-08 13:51:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892749747] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:51:01,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:51:01,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-08 13:51:01,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623299715] [2024-09-08 13:51:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:51:01,536 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 13:51:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:51:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 13:51:01,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-08 13:51:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:01,537 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:51:01,538 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 13:51:01,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:01,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 13:51:01,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:01,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:01,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:01,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 13:51:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 13:51:01,791 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 13:51:01,792 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:01,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash 542155386, now seen corresponding path program 3 times [2024-09-08 13:51:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:01,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619691016] [2024-09-08 13:51:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:01,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 13:51:01,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 13:51:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 13:51:01,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 13:51:01,968 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 13:51:01,969 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-09-08 13:51:01,971 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-09-08 13:51:01,971 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-09-08 13:51:01,971 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-09-08 13:51:01,971 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-09-08 13:51:01,972 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 13:51:01,979 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-09-08 13:51:01,983 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2024-09-08 13:51:02,051 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-08 13:51:02,051 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-08 13:51:02,056 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-08 13:51:02,056 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-08 13:51:02,057 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:51:02 BasicIcfg [2024-09-08 13:51:02,057 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-08 13:51:02,057 INFO L158 Benchmark]: Toolchain (without parser) took 8733.88ms. Allocated memory was 146.8MB in the beginning and 270.5MB in the end (delta: 123.7MB). Free memory was 68.9MB in the beginning and 185.8MB in the end (delta: -116.9MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-09-08 13:51:02,057 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 146.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 13:51:02,058 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 146.8MB. Free memory was 72.2MB in the beginning and 72.0MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 13:51:02,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 670.06ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 68.8MB in the beginning and 139.6MB in the end (delta: -70.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-09-08 13:51:02,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.30ms. Allocated memory is still 186.6MB. Free memory was 139.6MB in the beginning and 136.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 13:51:02,061 INFO L158 Benchmark]: Boogie Preprocessor took 36.40ms. Allocated memory is still 186.6MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 13:51:02,061 INFO L158 Benchmark]: RCFGBuilder took 720.88ms. Allocated memory is still 186.6MB. Free memory was 134.4MB in the beginning and 84.0MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-09-08 13:51:02,061 INFO L158 Benchmark]: TraceAbstraction took 7254.63ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 83.0MB in the beginning and 185.8MB in the end (delta: -102.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 13:51:02,063 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 146.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 146.8MB. Free memory was 72.2MB in the beginning and 72.0MB in the end (delta: 243.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 670.06ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 68.8MB in the beginning and 139.6MB in the end (delta: -70.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.30ms. Allocated memory is still 186.6MB. Free memory was 139.6MB in the beginning and 136.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.40ms. Allocated memory is still 186.6MB. Free memory was 136.5MB in the beginning and 134.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 720.88ms. Allocated memory is still 186.6MB. Free memory was 134.4MB in the beginning and 84.0MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7254.63ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 83.0MB in the beginning and 185.8MB in the end (delta: -102.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1728, independent: 1487, independent conditional: 1164, independent unconditional: 323, dependent: 241, dependent conditional: 202, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1619, independent: 1487, independent conditional: 1164, independent unconditional: 323, dependent: 132, dependent conditional: 93, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1619, independent: 1487, independent conditional: 1164, independent unconditional: 323, dependent: 132, dependent conditional: 93, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2008, independent: 1487, independent conditional: 1164, independent unconditional: 323, dependent: 521, dependent conditional: 482, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2008, independent: 1487, independent conditional: 114, independent unconditional: 1373, dependent: 521, dependent conditional: 126, dependent unconditional: 395, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2008, independent: 1487, independent conditional: 114, independent unconditional: 1373, dependent: 521, dependent conditional: 126, dependent unconditional: 395, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 344, independent conditional: 17, independent unconditional: 327, dependent: 58, dependent conditional: 16, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 402, independent: 307, independent conditional: 0, independent unconditional: 307, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 95, independent: 37, independent conditional: 17, independent unconditional: 20, dependent: 58, dependent conditional: 16, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 37, independent conditional: 17, independent unconditional: 20, dependent: 58, dependent conditional: 16, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1055, independent: 363, independent conditional: 147, independent unconditional: 216, dependent: 693, dependent conditional: 137, dependent unconditional: 555, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2008, independent: 1143, independent conditional: 97, independent unconditional: 1046, dependent: 463, dependent conditional: 110, dependent unconditional: 353, unknown: 402, unknown conditional: 33, unknown unconditional: 369] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 344, Positive conditional cache size: 17, Positive unconditional cache size: 327, Negative cache size: 58, Negative conditional cache size: 16, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1406, Maximal queried relation: 3, Independence queries for same thread: 109, Persistent sets #1 benchmarks: Persistent set computation time: 0.8s, Number of persistent set computation: 145, Number of trivial persistent sets: 97, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 362, independent: 323, independent conditional: 0, independent unconditional: 323, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1728, independent: 1487, independent conditional: 1164, independent unconditional: 323, dependent: 241, dependent conditional: 202, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1619, independent: 1487, independent conditional: 1164, independent unconditional: 323, dependent: 132, dependent conditional: 93, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1619, independent: 1487, independent conditional: 1164, independent unconditional: 323, dependent: 132, dependent conditional: 93, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2008, independent: 1487, independent conditional: 1164, independent unconditional: 323, dependent: 521, dependent conditional: 482, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2008, independent: 1487, independent conditional: 114, independent unconditional: 1373, dependent: 521, dependent conditional: 126, dependent unconditional: 395, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2008, independent: 1487, independent conditional: 114, independent unconditional: 1373, dependent: 521, dependent conditional: 126, dependent unconditional: 395, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 344, independent conditional: 17, independent unconditional: 327, dependent: 58, dependent conditional: 16, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 402, independent: 307, independent conditional: 0, independent unconditional: 307, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 95, independent: 37, independent conditional: 17, independent unconditional: 20, dependent: 58, dependent conditional: 16, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 37, independent conditional: 17, independent unconditional: 20, dependent: 58, dependent conditional: 16, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1055, independent: 363, independent conditional: 147, independent unconditional: 216, dependent: 693, dependent conditional: 137, dependent unconditional: 555, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2008, independent: 1143, independent conditional: 97, independent unconditional: 1046, dependent: 463, dependent conditional: 110, dependent unconditional: 353, unknown: 402, unknown conditional: 33, unknown unconditional: 369] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 344, Positive conditional cache size: 17, Positive unconditional cache size: 327, Negative cache size: 58, Negative conditional cache size: 16, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1406, Maximal queried relation: 3, Independence queries for same thread: 109 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L1] 0 //@ ghost int multithreaded = 0; [L805] 0 pthread_t t1441; [L806] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L806] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L807] 0 pthread_t t1442; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 0 //@ assert ((((((((((((((!multithreaded || (y$r_buff1_thd2 == (_Bool) 0)) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))); VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-1, t1442=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 0 //@ assert ((((((((((((((!multithreaded || (y$r_buff1_thd2 == (_Bool) 0)) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1)))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1441=-1, t1442=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 1 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L783] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L784] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L785] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L786] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L787] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 2 return 0; [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L810] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-1, t1442=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L812] RET 0 assume_abort_if_not(main$tmp_guard0) [L814] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-1, t1442=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L821] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1441=-1, t1442=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 808]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that 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: 808]: 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: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 53 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.4s, 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: 31, 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.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 1658 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-09-08 13:51:02,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-09-08 13:51:02,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE