/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.trace.refinement.strategy BADGER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-09 19:11:19,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 19:11:19,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 19:11:19,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 19:11:19,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 19:11:19,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 19:11:19,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 19:11:19,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 19:11:19,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 19:11:19,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 19:11:19,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 19:11:19,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 19:11:19,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 19:11:19,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 19:11:19,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 19:11:19,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 19:11:19,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 19:11:19,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 19:11:19,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 19:11:19,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 19:11:19,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 19:11:19,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 19:11:19,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 19:11:19,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 19:11:19,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 19:11:19,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 19:11:19,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 19:11:19,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 19:11:19,362 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 19:11:19,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 19:11:19,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 19:11:19,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 19:11:19,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 19:11:19,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 19:11:19,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 19:11:19,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 19:11:19,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 19:11:19,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 19:11:19,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 19:11:19,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 19:11:19,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 19:11:19,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-09 19:11:19,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 19:11:19,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 19:11:19,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 19:11:19,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 19:11:19,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 19:11:19,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 19:11:19,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 19:11:19,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 19:11:19,404 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 19:11:19,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 19:11:19,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 19:11:19,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 19:11:19,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 19:11:19,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 19:11:19,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 19:11:19,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 19:11:19,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 19:11:19,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 19:11:19,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 19:11:19,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 19:11:19,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 19:11:19,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 19:11:19,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 19:11:19,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 19:11:19,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 19:11:19,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 19:11:19,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 19:11:19,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 19:11:19,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 19:11:19,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 19:11:19,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 19:11:19,407 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 19:11:19,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 19:11:19,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 19:11:19,408 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 19:11:19,408 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 19:11:19,408 INFO L138 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/UAutomizer-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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> BADGER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-09 19:11:19,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 19:11:19,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 19:11:19,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 19:11:19,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 19:11:19,669 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 19:11:19,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-11-09 19:11:19,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6a3313d/1726aa9adaa24b2ab1a61ad00e53fc8a/FLAGcd01970a1 [2022-11-09 19:11:20,205 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 19:11:20,206 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i [2022-11-09 19:11:20,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6a3313d/1726aa9adaa24b2ab1a61ad00e53fc8a/FLAGcd01970a1 [2022-11-09 19:11:20,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6a3313d/1726aa9adaa24b2ab1a61ad00e53fc8a [2022-11-09 19:11:20,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 19:11:20,526 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 19:11:20,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 19:11:20,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 19:11:20,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 19:11:20,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:20" (1/1) ... [2022-11-09 19:11:20,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42680cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:20, skipping insertion in model container [2022-11-09 19:11:20,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:20" (1/1) ... [2022-11-09 19:11:20,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 19:11:20,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 19:11:20,721 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-09 19:11:20,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39095,39108] [2022-11-09 19:11:20,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39180,39193] [2022-11-09 19:11:20,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39232,39245] [2022-11-09 19:11:21,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49285,49298] [2022-11-09 19:11:21,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49334,49347] [2022-11-09 19:11:21,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49462,49475] [2022-11-09 19:11:21,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49520,49533] [2022-11-09 19:11:21,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 19:11:21,017 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 19:11:21,027 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-09 19:11:21,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39095,39108] [2022-11-09 19:11:21,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39180,39193] [2022-11-09 19:11:21,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[39232,39245] [2022-11-09 19:11:21,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49285,49298] [2022-11-09 19:11:21,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49334,49347] [2022-11-09 19:11:21,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49462,49475] [2022-11-09 19:11:21,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-2.i[49520,49533] [2022-11-09 19:11:21,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 19:11:21,142 INFO L208 MainTranslator]: Completed translation [2022-11-09 19:11:21,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21 WrapperNode [2022-11-09 19:11:21,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 19:11:21,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 19:11:21,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 19:11:21,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 19:11:21,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,214 INFO L138 Inliner]: procedures = 309, calls = 63, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 332 [2022-11-09 19:11:21,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 19:11:21,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 19:11:21,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 19:11:21,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 19:11:21,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,276 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 19:11:21,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 19:11:21,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 19:11:21,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 19:11:21,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (1/1) ... [2022-11-09 19:11:21,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 19:11:21,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 19:11:21,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-09 19:11:21,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-09 19:11:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-11-09 19:11:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-11-09 19:11:21,364 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-11-09 19:11:21,364 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-11-09 19:11:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 19:11:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 19:11:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 19:11:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 19:11:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 19:11:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 19:11:21,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 19:11:21,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 19:11:21,366 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-09 19:11:21,510 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 19:11:21,512 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 19:11:22,115 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 19:11:22,129 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 19:11:22,129 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-09 19:11:22,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:22 BoogieIcfgContainer [2022-11-09 19:11:22,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 19:11:22,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 19:11:22,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 19:11:22,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 19:11:22,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:11:20" (1/3) ... [2022-11-09 19:11:22,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4616215b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:22, skipping insertion in model container [2022-11-09 19:11:22,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:21" (2/3) ... [2022-11-09 19:11:22,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4616215b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:22, skipping insertion in model container [2022-11-09 19:11:22,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:22" (3/3) ... [2022-11-09 19:11:22,143 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2022-11-09 19:11:22,150 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 19:11:22,158 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 19:11:22,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-11-09 19:11:22,159 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 19:11:22,305 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-09 19:11:22,364 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:11:22,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 19:11:22,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 19:11:22,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-09 19:11:22,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-09 19:11:22,414 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 19:11:22,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == writer_fnThread1of1ForFork1 ======== [2022-11-09 19:11:22,439 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4a0db545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:11:22,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-09 19:11:22,735 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting writer_fnErr2ASSERT_VIOLATIONDATA_RACE === [writer_fnErr0ASSERT_VIOLATIONDATA_RACE, writer_fnErr2ASSERT_VIOLATIONDATA_RACE, writer_fnErr1ASSERT_VIOLATIONDATA_RACE, writer_fnErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-09 19:11:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1622393569, now seen corresponding path program 1 times [2022-11-09 19:11:22,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:22,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010688502] [2022-11-09 19:11:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 19:11:23,011 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:23,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010688502] [2022-11-09 19:11:23,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010688502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:23,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:23,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 19:11:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257584015] [2022-11-09 19:11:23,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:23,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-09 19:11:23,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:23,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-09 19:11:23,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-09 19:11:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,039 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:23,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 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) [2022-11-09 19:11:23,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 19:11:23,137 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting writer_fnErr0ASSERT_VIOLATIONDATA_RACE === [writer_fnErr0ASSERT_VIOLATIONDATA_RACE, writer_fnErr2ASSERT_VIOLATIONDATA_RACE, writer_fnErr1ASSERT_VIOLATIONDATA_RACE, writer_fnErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-09 19:11:23,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:23,137 INFO L85 PathProgramCache]: Analyzing trace with hash -472270628, now seen corresponding path program 1 times [2022-11-09 19:11:23,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:23,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373154588] [2022-11-09 19:11:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 19:11:23,709 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:23,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373154588] [2022-11-09 19:11:23,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373154588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:23,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:23,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 19:11:23,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014998540] [2022-11-09 19:11:23,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:23,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 19:11:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 19:11:23,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 19:11:23,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,712 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:23,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 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) [2022-11-09 19:11:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 19:11:23,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting writer_fnErr1ASSERT_VIOLATIONDATA_RACE === [writer_fnErr0ASSERT_VIOLATIONDATA_RACE, writer_fnErr2ASSERT_VIOLATIONDATA_RACE, writer_fnErr1ASSERT_VIOLATIONDATA_RACE, writer_fnErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-09 19:11:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash -704642365, now seen corresponding path program 1 times [2022-11-09 19:11:23,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:23,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890849158] [2022-11-09 19:11:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:23,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 19:11:24,368 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:24,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890849158] [2022-11-09 19:11:24,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890849158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:24,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:24,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 19:11:24,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281905062] [2022-11-09 19:11:24,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:24,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 19:11:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:24,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 19:11:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 19:11:24,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:24,371 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:24,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 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) [2022-11-09 19:11:24,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:24,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:24,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:24,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:24,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:24,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:24,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-09 19:11:24,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting writer_fnErr3ASSERT_VIOLATIONDATA_RACE === [writer_fnErr0ASSERT_VIOLATIONDATA_RACE, writer_fnErr2ASSERT_VIOLATIONDATA_RACE, writer_fnErr1ASSERT_VIOLATIONDATA_RACE, writer_fnErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-09 19:11:24,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1002688204, now seen corresponding path program 1 times [2022-11-09 19:11:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:24,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253570189] [2022-11-09 19:11:24,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:24,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 19:11:24,901 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:24,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253570189] [2022-11-09 19:11:24,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253570189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:24,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:24,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 19:11:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017566352] [2022-11-09 19:11:24,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:24,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 19:11:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:24,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 19:11:24,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 19:11:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:24,904 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:24,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 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) [2022-11-09 19:11:24,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:24,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:24,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:24,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-09 19:11:25,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting writer_fnErr5ASSERT_VIOLATIONDATA_RACE === [writer_fnErr0ASSERT_VIOLATIONDATA_RACE, writer_fnErr2ASSERT_VIOLATIONDATA_RACE, writer_fnErr1ASSERT_VIOLATIONDATA_RACE, writer_fnErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-09 19:11:25,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1029364348, now seen corresponding path program 1 times [2022-11-09 19:11:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:25,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922009305] [2022-11-09 19:11:25,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 19:11:25,631 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:25,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922009305] [2022-11-09 19:11:25,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922009305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:25,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:25,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 19:11:25,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975815222] [2022-11-09 19:11:25,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:25,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 19:11:25,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:25,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 19:11:25,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 19:11:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,635 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:25,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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) [2022-11-09 19:11:25,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-09 19:11:25,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting writer_fnErr5ASSERT_VIOLATIONDATA_RACE === [writer_fnErr0ASSERT_VIOLATIONDATA_RACE, writer_fnErr2ASSERT_VIOLATIONDATA_RACE, writer_fnErr1ASSERT_VIOLATIONDATA_RACE, writer_fnErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-09 19:11:25,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:25,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1618456721, now seen corresponding path program 1 times [2022-11-09 19:11:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:25,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495205806] [2022-11-09 19:11:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 19:11:25,892 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:25,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495205806] [2022-11-09 19:11:25,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495205806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:25,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:25,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 19:11:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174296718] [2022-11-09 19:11:25,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:25,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 19:11:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:25,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 19:11:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 19:11:25,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,894 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:25,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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) [2022-11-09 19:11:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:25,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-09 19:11:25,958 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting writer_fnErr5ASSERT_VIOLATIONDATA_RACE === [writer_fnErr0ASSERT_VIOLATIONDATA_RACE, writer_fnErr2ASSERT_VIOLATIONDATA_RACE, writer_fnErr1ASSERT_VIOLATIONDATA_RACE, writer_fnErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-09 19:11:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1417761521, now seen corresponding path program 1 times [2022-11-09 19:11:25,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:25,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76466793] [2022-11-09 19:11:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:25,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 19:11:26,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-09 19:11:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 19:11:26,092 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2022-11-09 19:11:26,092 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-09 19:11:26,093 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location writer_fnErr5ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2022-11-09 19:11:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2022-11-09 19:11:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2022-11-09 19:11:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2022-11-09 19:11:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr3ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2022-11-09 19:11:26,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr4ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2022-11-09 19:11:26,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-09 19:11:26,100 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-09 19:11:26,102 INFO L307 ceAbstractionStarter]: Result for error location writer_fnThread1of1ForFork1 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/3) [2022-11-09 19:11:26,105 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-09 19:11:26,105 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-09 19:11:26,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:11:26 BasicIcfg [2022-11-09 19:11:26,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-09 19:11:26,187 INFO L158 Benchmark]: Toolchain (without parser) took 5660.99ms. Allocated memory was 290.5MB in the beginning and 349.2MB in the end (delta: 58.7MB). Free memory was 261.1MB in the beginning and 224.8MB in the end (delta: 36.3MB). Peak memory consumption was 95.0MB. Max. memory is 8.0GB. [2022-11-09 19:11:26,188 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-09 19:11:26,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.43ms. Allocated memory is still 290.5MB. Free memory was 261.1MB in the beginning and 234.6MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-11-09 19:11:26,188 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.79ms. Allocated memory is still 290.5MB. Free memory was 234.6MB in the beginning and 229.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-09 19:11:26,189 INFO L158 Benchmark]: Boogie Preprocessor took 67.20ms. Allocated memory is still 290.5MB. Free memory was 229.4MB in the beginning and 225.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-09 19:11:26,189 INFO L158 Benchmark]: RCFGBuilder took 849.31ms. Allocated memory is still 290.5MB. Free memory was 225.2MB in the beginning and 186.4MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-11-09 19:11:26,189 INFO L158 Benchmark]: TraceAbstraction took 4053.04ms. Allocated memory was 290.5MB in the beginning and 349.2MB in the end (delta: 58.7MB). Free memory was 185.8MB in the beginning and 224.8MB in the end (delta: -39.0MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. [2022-11-09 19:11:26,191 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 616.43ms. Allocated memory is still 290.5MB. Free memory was 261.1MB in the beginning and 234.6MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.79ms. Allocated memory is still 290.5MB. Free memory was 234.6MB in the beginning and 229.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.20ms. Allocated memory is still 290.5MB. Free memory was 229.4MB in the beginning and 225.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 849.31ms. Allocated memory is still 290.5MB. Free memory was 225.2MB in the beginning and 186.4MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4053.04ms. Allocated memory was 290.5MB in the beginning and 349.2MB in the end (delta: 58.7MB). Free memory was 185.8MB in the beginning and 224.8MB in the end (delta: -39.0MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16653, positive: 16509, positive conditional: 1068, positive unconditional: 15441, negative: 144, negative conditional: 54, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16605, positive: 16509, positive conditional: 1068, positive unconditional: 15441, negative: 96, negative conditional: 6, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16605, positive: 16509, positive conditional: 1068, positive unconditional: 15441, negative: 96, negative conditional: 6, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16615, positive: 16509, positive conditional: 2, positive unconditional: 16507, negative: 106, negative conditional: 8, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16615, positive: 16509, positive conditional: 2, positive unconditional: 16507, negative: 106, negative conditional: 2, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16615, positive: 16509, positive conditional: 2, positive unconditional: 16507, negative: 106, negative conditional: 2, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15296, positive: 15200, positive conditional: 2, positive unconditional: 15198, negative: 96, negative conditional: 2, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15296, positive: 15045, positive conditional: 0, positive unconditional: 15045, negative: 251, negative conditional: 0, negative unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 251, positive: 155, positive conditional: 2, positive unconditional: 153, negative: 96, negative conditional: 2, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 498, positive: 289, positive conditional: 4, positive unconditional: 285, negative: 209, negative conditional: 7, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16615, positive: 1309, positive conditional: 0, positive unconditional: 1309, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 15296, unknown conditional: 4, unknown unconditional: 15292] , Statistics on independence cache: Total cache size (in pairs): 15296, Positive cache size: 15200, Positive conditional cache size: 2, Positive unconditional cache size: 15198, Negative cache size: 96, Negative conditional cache size: 2, Negative unconditional cache size: 94, Eliminated conditions: 6, Maximal queried relation: 2, Independence queries for same thread: 48 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.6s, Number of persistent set computation: 136, Number of trivial persistent sets: 109, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15531, positive: 15441, positive conditional: 0, positive unconditional: 15441, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16653, positive: 16509, positive conditional: 1068, positive unconditional: 15441, negative: 144, negative conditional: 54, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16605, positive: 16509, positive conditional: 1068, positive unconditional: 15441, negative: 96, negative conditional: 6, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16605, positive: 16509, positive conditional: 1068, positive unconditional: 15441, negative: 96, negative conditional: 6, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16615, positive: 16509, positive conditional: 2, positive unconditional: 16507, negative: 106, negative conditional: 8, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16615, positive: 16509, positive conditional: 2, positive unconditional: 16507, negative: 106, negative conditional: 2, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16615, positive: 16509, positive conditional: 2, positive unconditional: 16507, negative: 106, negative conditional: 2, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15296, positive: 15200, positive conditional: 2, positive unconditional: 15198, negative: 96, negative conditional: 2, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15296, positive: 15045, positive conditional: 0, positive unconditional: 15045, negative: 251, negative conditional: 0, negative unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 251, positive: 155, positive conditional: 2, positive unconditional: 153, negative: 96, negative conditional: 2, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 498, positive: 289, positive conditional: 4, positive unconditional: 285, negative: 209, negative conditional: 7, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16615, positive: 1309, positive conditional: 0, positive unconditional: 1309, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 15296, unknown conditional: 4, unknown unconditional: 15292] , Statistics on independence cache: Total cache size (in pairs): 15296, Positive cache size: 15200, Positive conditional cache size: 2, Positive unconditional cache size: 15198, Negative cache size: 96, Negative conditional cache size: 2, Negative unconditional cache size: 94, Eliminated conditions: 6, Maximal queried relation: 2, Independence queries for same thread: 48 - DataRaceFoundResult [Line: 812]: Data race detected Data race detected The following path leads to a data race: [L1072] 0 pthread_t reader, writer; VAL [reader={10:0}, writer={11:0}] [L1073] 0 Ring r; VAL [r={9:0}, reader={10:0}, writer={11:0}] [L1074] CALL 0 ring_init( &r ) [L823] EXPR 0 r->writer = 0 VAL [r={9:0}, r={9:0}, r->writer = 0=115] [L823] 0 r->reader = r->writer = 0 VAL [r={9:0}, r={9:0}, r->reader = r->writer = 0=116, r->writer = 0=115] [L1074] RET 0 ring_init( &r ) [L1075] FCALL, FORK 0 pthread_create( &reader, ((void *)0), &reader_two, &r ) VAL [pthread_create( &reader, ((void *)0), &reader_two, &r )=12, r={9:0}, reader={10:0}, writer={11:0}] [L1076] FCALL, FORK 0 pthread_create( &writer, ((void *)0), &writer_fn, &r ) VAL [pthread_create( &writer, ((void *)0), &writer_fn, &r )=13, r={9:0}, reader={10:0}, writer={11:0}] [L842] 2 Ring *r = arg; VAL [arg={9:0}, arg={9:0}, r={9:0}] [L843] 2 long i = 0; VAL [arg={9:0}, arg={9:0}, i=0, r={9:0}] [L843] COND TRUE 2 i < 8 VAL [arg={9:0}, arg={9:0}, i=0, r={9:0}] [L845] CALL 2 ring_enqueue( r, i + 1 ) [L810] EXPR 2 r->writer VAL [\old(x)=1, r={9:0}, r={9:0}, r->writer=0, x=1] [L810] EXPR 2 r->writer + 1 VAL [\old(x)=1, r={9:0}, r={9:0}, r->writer=0, x=1] [L810] EXPR 2 r->reader VAL [\old(x)=1, r={9:0}, r={9:0}, r->reader=0, r->writer=0, x=1] [L810] 2 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, r={9:0}, r={9:0}, r->reader=0, r->writer=0, x=1] [L810] COND FALSE 2 !((r->writer + 1) % 4 == r->reader) VAL [\old(x)=1, r={9:0}, r={9:0}, r->reader=0, r->writer=0, x=1] [L811] EXPR 2 r->writer VAL [\old(x)=1, r={9:0}, r={9:0}, r->writer=0, x=1] [L811] EXPR 2 r->q[ r->writer ] VAL [\old(x)=1, r={9:0}, r={9:0}, r->writer=0, x=1] [L811] 2 r->q[ r->writer ] = x VAL [\old(x)=1, r={9:0}, r={9:0}, r->q[ r->writer ] = x=117, r->writer=0, x=1] [L812] EXPR 2 r->writer VAL [\old(x)=1, r={9:0}, r={9:0}, r->writer=0, x=1] [L812] EXPR 2 r->writer + 1 VAL [\old(x)=1, r={9:0}, r={9:0}, r->writer=0, x=1] [L812] 2 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, r={9:0}, r={9:0}, r->writer=0, r->writer = (r->writer + 1) % 4=118, x=1] [L1077] CALL 0 writer_fn( &r ) [L842] 0 Ring *r = arg; VAL [arg={9:0}, arg={9:0}, arg={9:0}, arg={9:0}, i=0, r={9:0}, r={9:0}] [L843] 0 long i = 0; VAL [arg={9:0}, arg={9:0}, arg={9:0}, arg={9:0}, i=0, i=0, r={9:0}, r={9:0}] [L843] COND TRUE 0 i < 8 VAL [arg={9:0}, arg={9:0}, arg={9:0}, arg={9:0}, i=0, i=0, r={9:0}, r={9:0}] [L845] CALL 0 ring_enqueue( r, i + 1 ) [L810] EXPR 0 r->writer VAL [\old(x)=1, \old(x)=1, r={9:0}, r={9:0}, r={9:0}, r={9:0}, r->writer=0, r->writer=1, r->writer = (r->writer + 1) % 4=118, x=1, x=1] [L810] 0 r->writer + 1 VAL [\old(x)=1, \old(x)=1, r={9:0}, r={9:0}, r={9:0}, r={9:0}, r->writer=0, r->writer=1, r->writer = (r->writer + 1) % 4=118, x=1, x=1] [L812] 2 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, \old(x)=1, r={9:0}, r={9:0}, r={9:0}, r={9:0}, r->writer=0, r->writer=1, r->writer = (r->writer + 1) % 4=118, x=1, x=1] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: r->writer + 1 [812] * C: r->writer = 0 [823] * C: r->writer + 1 [810] * C: r->writer = 0 [823] * C: r->q[ r->writer ] [811] * C: r->q[ r->writer ] = x [811] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->reader = r->writer = 0 [823] * C: r->writer = 0 [823] * C: r->writer + 1 [812] * C: r->writer + 1 [812] * C: r->q[ r->writer ] = x [811] * C: r->q[ r->writer ] [811] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->writer + 1 [810] * C: r->reader = r->writer = 0 [823] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->writer + 1 [810] * C: r->writer + 1 [812] * C: r->q[ r->writer ] [811] * C: r->reader = r->writer = 0 [823] * C: r->writer + 1 [810] * C: r->q[ r->writer ] = x [811] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->q[ r->writer ] = x [811] * C: r->q[ r->writer ] [811] * C: r->reader = r->writer = 0 [823] * C: r->writer = 0 [823] and C: r->writer = (r->writer + 1) % 4 [812] - UnprovableResult [Line: 810]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: writer_fnThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 578 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.2s, 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: 29, 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, 1.9s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 902 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! [2022-11-09 19:11:26,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-09 19:11:26,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...