/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-09 19:11:18,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-09 19:11:18,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-09 19:11:18,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-09 19:11:18,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-09 19:11:18,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-09 19:11:18,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-09 19:11:18,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-09 19:11:18,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-09 19:11:18,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-09 19:11:18,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-09 19:11:18,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-09 19:11:18,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-09 19:11:18,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-09 19:11:18,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-09 19:11:18,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-09 19:11:18,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-09 19:11:18,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-09 19:11:18,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-09 19:11:18,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-09 19:11:18,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-09 19:11:18,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-09 19:11:18,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-09 19:11:18,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-09 19:11:18,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-09 19:11:18,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-09 19:11:18,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-09 19:11:18,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-09 19:11:18,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-09 19:11:18,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-09 19:11:18,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-09 19:11:18,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-09 19:11:18,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-09 19:11:18,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-09 19:11:18,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-09 19:11:18,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-09 19:11:18,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-09 19:11:18,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-09 19:11:18,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-09 19:11:18,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-09 19:11:18,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-09 19:11:18,209 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:18,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-09 19:11:18,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-09 19:11:18,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-09 19:11:18,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-09 19:11:18,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-09 19:11:18,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-09 19:11:18,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-09 19:11:18,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-09 19:11:18,225 INFO L138 SettingsManager]: * Use SBE=true [2022-11-09 19:11:18,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-09 19:11:18,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-09 19:11:18,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-09 19:11:18,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-09 19:11:18,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-09 19:11:18,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-09 19:11:18,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-09 19:11:18,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-09 19:11:18,226 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-09 19:11:18,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-09 19:11:18,226 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-09 19:11:18,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-09 19:11:18,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-09 19:11:18,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-09 19:11:18,227 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-09 19:11:18,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-09 19:11:18,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 19:11:18,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-09 19:11:18,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-09 19:11:18,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-09 19:11:18,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-09 19:11:18,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-09 19:11:18,228 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-09 19:11:18,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-09 19:11:18,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-09 19:11:18,228 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-09 19:11:18,229 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-09 19:11:18,229 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:18,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-09 19:11:18,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-09 19:11:18,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-09 19:11:18,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-09 19:11:18,412 INFO L275 PluginConnector]: CDTParser initialized [2022-11-09 19:11:18,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-11-09 19:11:18,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c198716/aa4e1fa530114b11b6fb307a075e4fba/FLAGa05d8094d [2022-11-09 19:11:18,805 INFO L306 CDTParser]: Found 1 translation units. [2022-11-09 19:11:18,805 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2022-11-09 19:11:18,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c198716/aa4e1fa530114b11b6fb307a075e4fba/FLAGa05d8094d [2022-11-09 19:11:19,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c198716/aa4e1fa530114b11b6fb307a075e4fba [2022-11-09 19:11:19,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-09 19:11:19,221 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-09 19:11:19,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-09 19:11:19,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-09 19:11:19,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-09 19:11:19,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:19" (1/1) ... [2022-11-09 19:11:19,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e7b95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:19, skipping insertion in model container [2022-11-09 19:11:19,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:19" (1/1) ... [2022-11-09 19:11:19,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-09 19:11:19,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-09 19:11:19,406 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-09 19:11:19,598 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-1.i[39095,39108] [2022-11-09 19:11:19,600 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-1.i[39180,39193] [2022-11-09 19:11:19,601 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-1.i[39232,39245] [2022-11-09 19:11:19,644 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-1.i[49388,49401] [2022-11-09 19:11:19,644 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-1.i[49437,49450] [2022-11-09 19:11:19,646 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-1.i[49565,49578] [2022-11-09 19:11:19,648 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-1.i[49623,49636] [2022-11-09 19:11:19,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 19:11:19,662 INFO L203 MainTranslator]: Completed pre-run [2022-11-09 19:11:19,676 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-09 19:11:19,697 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-1.i[39095,39108] [2022-11-09 19:11:19,697 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-1.i[39180,39193] [2022-11-09 19:11:19,698 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-1.i[39232,39245] [2022-11-09 19:11:19,709 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-1.i[49388,49401] [2022-11-09 19:11:19,713 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-1.i[49437,49450] [2022-11-09 19:11:19,715 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-1.i[49565,49578] [2022-11-09 19:11:19,715 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-1.i[49623,49636] [2022-11-09 19:11:19,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-09 19:11:19,758 INFO L208 MainTranslator]: Completed translation [2022-11-09 19:11:19,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:19 WrapperNode [2022-11-09 19:11:19,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-09 19:11:19,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-09 19:11:19,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-09 19:11:19,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-09 19:11:19,765 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:19" (1/1) ... [2022-11-09 19:11:19,780 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:19" (1/1) ... [2022-11-09 19:11:19,810 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 345 [2022-11-09 19:11:19,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-09 19:11:19,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-09 19:11:19,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-09 19:11:19,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-09 19:11:19,817 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:19" (1/1) ... [2022-11-09 19:11:19,817 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:19" (1/1) ... [2022-11-09 19:11:19,822 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:19" (1/1) ... [2022-11-09 19:11:19,823 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:19" (1/1) ... [2022-11-09 19:11:19,838 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:19" (1/1) ... [2022-11-09 19:11:19,842 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:19" (1/1) ... [2022-11-09 19:11:19,844 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:19" (1/1) ... [2022-11-09 19:11:19,846 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:19" (1/1) ... [2022-11-09 19:11:19,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-09 19:11:19,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-09 19:11:19,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-09 19:11:19,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-09 19:11:19,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:19" (1/1) ... [2022-11-09 19:11:19,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-09 19:11:19,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 19:11:19,883 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:19,902 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:19,912 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-11-09 19:11:19,913 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-11-09 19:11:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-11-09 19:11:19,913 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-11-09 19:11:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-09 19:11:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-09 19:11:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-09 19:11:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-09 19:11:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-09 19:11:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-09 19:11:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-09 19:11:19,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-09 19:11:19,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-09 19:11:19,914 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:20,007 INFO L235 CfgBuilder]: Building ICFG [2022-11-09 19:11:20,008 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-09 19:11:20,402 INFO L276 CfgBuilder]: Performing block encoding [2022-11-09 19:11:20,409 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-09 19:11:20,409 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-09 19:11:20,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:20 BoogieIcfgContainer [2022-11-09 19:11:20,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-09 19:11:20,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-09 19:11:20,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-09 19:11:20,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-09 19:11:20,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:11:19" (1/3) ... [2022-11-09 19:11:20,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7876f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:20, skipping insertion in model container [2022-11-09 19:11:20,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:19" (2/3) ... [2022-11-09 19:11:20,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7876f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:20, skipping insertion in model container [2022-11-09 19:11:20,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:20" (3/3) ... [2022-11-09 19:11:20,416 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-11-09 19:11:20,421 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-09 19:11:20,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-09 19:11:20,426 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-11-09 19:11:20,427 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-09 19:11:20,504 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-09 19:11:20,554 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:11:20,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-09 19:11:20,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-09 19:11:20,572 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:20,591 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:20,602 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-09 19:11:20,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == writer_fnThread1of1ForFork0 ======== [2022-11-09 19:11:20,625 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;@2e4fc320, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-09 19:11:20,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-09 19:11:20,884 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:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash -797647972, now seen corresponding path program 1 times [2022-11-09 19:11:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:20,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425620138] [2022-11-09 19:11:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:21,165 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:21,166 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:21,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425620138] [2022-11-09 19:11:21,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425620138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:21,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:21,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-09 19:11:21,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443478167] [2022-11-09 19:11:21,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:21,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-09 19:11:21,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:21,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-09 19:11:21,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-09 19:11:21,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:21,190 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:21,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 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:21,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:21,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:21,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-09 19:11:21,297 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:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1666420829, now seen corresponding path program 1 times [2022-11-09 19:11:21,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:21,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119625942] [2022-11-09 19:11:21,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:21,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:21,808 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:21,809 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:21,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119625942] [2022-11-09 19:11:21,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119625942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:21,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:21,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 19:11:21,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598192628] [2022-11-09 19:11:21,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:21,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 19:11:21,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:21,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 19:11:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 19:11:21,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:21,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:21,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 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:21,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:21,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:21,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-09 19:11:21,950 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:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1272963076, now seen corresponding path program 1 times [2022-11-09 19:11:21,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:21,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868761897] [2022-11-09 19:11:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:21,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:22,193 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:22,193 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:22,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868761897] [2022-11-09 19:11:22,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868761897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:22,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:22,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 19:11:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393077115] [2022-11-09 19:11:22,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:22,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 19:11:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:22,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 19:11:22,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 19:11:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:22,195 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:22,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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:22,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:22,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:22,196 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:22,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:22,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-09 19:11:22,324 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:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1838352501, now seen corresponding path program 1 times [2022-11-09 19:11:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:22,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632886762] [2022-11-09 19:11:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:22,706 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:22,707 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:22,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632886762] [2022-11-09 19:11:22,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632886762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:22,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:22,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 19:11:22,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482978608] [2022-11-09 19:11:22,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:22,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 19:11:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:22,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 19:11:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 19:11:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:22,709 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:22,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 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:22,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:22,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:22,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:22,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:22,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-09 19:11:22,964 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:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1336548287, now seen corresponding path program 1 times [2022-11-09 19:11:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:22,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069427151] [2022-11-09 19:11:22,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:22,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:23,310 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,310 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:23,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069427151] [2022-11-09 19:11:23,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069427151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:23,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:23,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-09 19:11:23,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728652645] [2022-11-09 19:11:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:23,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-09 19:11:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:23,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-09 19:11:23,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-09 19:11:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,313 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:23,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 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,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-09 19:11:23,462 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:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1222523219, now seen corresponding path program 1 times [2022-11-09 19:11:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:23,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134772520] [2022-11-09 19:11:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-09 19:11:23,670 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:23,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134772520] [2022-11-09 19:11:23,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134772520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:23,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:23,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 19:11:23,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954152356] [2022-11-09 19:11:23,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:23,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 19:11:23,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:23,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 19:11:23,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 19:11:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,674 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:23,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:23,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-09 19:11:23,740 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:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1468511103, now seen corresponding path program 1 times [2022-11-09 19:11:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:23,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888634128] [2022-11-09 19:11:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:23,817 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,818 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:23,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888634128] [2022-11-09 19:11:23,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888634128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:23,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:23,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-09 19:11:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977740939] [2022-11-09 19:11:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:23,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-09 19:11:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:23,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-09 19:11:23,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-09 19:11:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,819 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:23,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:23,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:23,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-09 19:11:23,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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:23,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:23,895 INFO L85 PathProgramCache]: Analyzing trace with hash -675247777, now seen corresponding path program 1 times [2022-11-09 19:11:23,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:23,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046958060] [2022-11-09 19:11:23,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:23,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:25,100 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,100 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:25,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046958060] [2022-11-09 19:11:25,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046958060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-09 19:11:25,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-09 19:11:25,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-09 19:11:25,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29818045] [2022-11-09 19:11:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-09 19:11:25,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-09 19:11:25,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:25,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-09 19:11:25,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-09 19:11:25,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,102 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:25,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.588235294117647) internal successors, (146), 18 states have internal predecessors, (146), 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,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:25,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-09 19:11:25,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-09 19:11:25,997 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash -906160348, now seen corresponding path program 1 times [2022-11-09 19:11:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:25,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962058126] [2022-11-09 19:11:25,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-09 19:11:26,154 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:26,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962058126] [2022-11-09 19:11:26,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962058126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 19:11:26,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-09 19:11:26,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2022-11-09 19:11:26,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608903575] [2022-11-09 19:11:26,157 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-09 19:11:26,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-09 19:11:26,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:26,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-09 19:11:26,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-09 19:11:26,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:26,160 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:26,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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:26,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:26,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:26,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:26,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:26,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:26,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:26,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:26,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-09 19:11:26,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 19:11:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-09 19:11:26,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-09 19:11:26,433 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:26,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1222899110, now seen corresponding path program 1 times [2022-11-09 19:11:26,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:26,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378180756] [2022-11-09 19:11:26,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:26,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-09 19:11:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-09 19:11:28,112 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-11-09 19:11:28,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378180756] [2022-11-09 19:11:28,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378180756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-09 19:11:28,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-09 19:11:28,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-11-09 19:11:28,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193513625] [2022-11-09 19:11:28,112 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-09 19:11:28,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-09 19:11:28,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-11-09 19:11:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-09 19:11:28,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-09 19:11:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:28,114 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-09 19:11:28,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 15.235294117647058) internal successors, (259), 18 states have internal predecessors, (259), 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:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-09 19:11:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-09 19:11:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-09 19:11:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-09 19:11:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-09 19:11:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 19:11:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-09 19:11:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-09 19:11:29,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-09 19:11:29,136 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-09 19:11:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 52095926, now seen corresponding path program 1 times [2022-11-09 19:11:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-11-09 19:11:29,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023158173] [2022-11-09 19:11:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-09 19:11:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-09 19:11:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 19:11:29,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-09 19:11:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-09 19:11:29,643 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2022-11-09 19:11:29,643 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-09 19:11:29,644 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location writer_fnErr5ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2022-11-09 19:11:29,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2022-11-09 19:11:29,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2022-11-09 19:11:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2022-11-09 19:11:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr3ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2022-11-09 19:11:29,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location writer_fnErr4ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2022-11-09 19:11:29,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-09 19:11:29,650 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-09 19:11:29,650 INFO L307 ceAbstractionStarter]: Result for error location writer_fnThread1of1ForFork0 was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/3) [2022-11-09 19:11:29,653 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-09 19:11:29,653 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-09 19:11:29,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:11:29 BasicIcfg [2022-11-09 19:11:29,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-09 19:11:29,779 INFO L158 Benchmark]: Toolchain (without parser) took 10558.00ms. Allocated memory was 181.4MB in the beginning and 636.5MB in the end (delta: 455.1MB). Free memory was 152.7MB in the beginning and 339.3MB in the end (delta: -186.6MB). Peak memory consumption was 268.4MB. Max. memory is 8.0GB. [2022-11-09 19:11:29,779 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory was 137.5MB in the beginning and 137.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-09 19:11:29,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.90ms. Allocated memory was 181.4MB in the beginning and 251.7MB in the end (delta: 70.3MB). Free memory was 152.7MB in the beginning and 195.9MB in the end (delta: -43.2MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2022-11-09 19:11:29,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.95ms. Allocated memory is still 251.7MB. Free memory was 195.9MB in the beginning and 191.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-09 19:11:29,780 INFO L158 Benchmark]: Boogie Preprocessor took 37.48ms. Allocated memory is still 251.7MB. Free memory was 191.2MB in the beginning and 186.4MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-09 19:11:29,780 INFO L158 Benchmark]: RCFGBuilder took 561.33ms. Allocated memory is still 251.7MB. Free memory was 186.4MB in the beginning and 146.6MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-11-09 19:11:29,781 INFO L158 Benchmark]: TraceAbstraction took 9367.17ms. Allocated memory was 251.7MB in the beginning and 636.5MB in the end (delta: 384.8MB). Free memory was 146.1MB in the beginning and 339.3MB in the end (delta: -193.2MB). Peak memory consumption was 191.6MB. Max. memory is 8.0GB. [2022-11-09 19:11:29,782 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.12ms. Allocated memory is still 181.4MB. Free memory was 137.5MB in the beginning and 137.3MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 533.90ms. Allocated memory was 181.4MB in the beginning and 251.7MB in the end (delta: 70.3MB). Free memory was 152.7MB in the beginning and 195.9MB in the end (delta: -43.2MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.95ms. Allocated memory is still 251.7MB. Free memory was 195.9MB in the beginning and 191.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.48ms. Allocated memory is still 251.7MB. Free memory was 191.2MB in the beginning and 186.4MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 561.33ms. Allocated memory is still 251.7MB. Free memory was 186.4MB in the beginning and 146.6MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 9367.17ms. Allocated memory was 251.7MB in the beginning and 636.5MB in the end (delta: 384.8MB). Free memory was 146.1MB in the beginning and 339.3MB in the end (delta: -193.2MB). Peak memory consumption was 191.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32232, positive: 31822, positive conditional: 3912, positive unconditional: 27910, negative: 410, negative conditional: 209, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32045, positive: 31822, positive conditional: 3912, positive unconditional: 27910, negative: 223, negative conditional: 22, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32045, positive: 31822, positive conditional: 3912, positive unconditional: 27910, negative: 223, negative conditional: 22, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32134, positive: 31822, positive conditional: 21, positive unconditional: 31801, negative: 312, negative conditional: 68, negative unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32134, positive: 31822, positive conditional: 21, positive unconditional: 31801, negative: 312, negative conditional: 19, negative unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32134, positive: 31822, positive conditional: 21, positive unconditional: 31801, negative: 312, negative conditional: 19, negative unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25063, positive: 24836, positive conditional: 17, positive unconditional: 24819, negative: 227, negative conditional: 16, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25063, positive: 24509, positive conditional: 0, positive unconditional: 24509, negative: 554, negative conditional: 0, negative unconditional: 554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 554, positive: 327, positive conditional: 17, positive unconditional: 310, negative: 227, negative conditional: 16, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 822, positive: 448, positive conditional: 59, positive unconditional: 389, negative: 374, negative conditional: 45, negative unconditional: 330, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32134, positive: 6986, positive conditional: 4, positive unconditional: 6982, negative: 85, negative conditional: 3, negative unconditional: 82, unknown: 25063, unknown conditional: 33, unknown unconditional: 25030] , Statistics on independence cache: Total cache size (in pairs): 25063, Positive cache size: 24836, Positive conditional cache size: 17, Positive unconditional cache size: 24819, Negative cache size: 227, Negative conditional cache size: 16, Negative unconditional cache size: 211, Eliminated conditions: 49, Maximal queried relation: 5, Independence queries for same thread: 187 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.9s, Number of persistent set computation: 376, Number of trivial persistent sets: 256, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28111, positive: 27910, positive conditional: 0, positive unconditional: 27910, negative: 201, negative conditional: 0, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32232, positive: 31822, positive conditional: 3912, positive unconditional: 27910, negative: 410, negative conditional: 209, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32045, positive: 31822, positive conditional: 3912, positive unconditional: 27910, negative: 223, negative conditional: 22, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32045, positive: 31822, positive conditional: 3912, positive unconditional: 27910, negative: 223, negative conditional: 22, negative unconditional: 201, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32134, positive: 31822, positive conditional: 21, positive unconditional: 31801, negative: 312, negative conditional: 68, negative unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32134, positive: 31822, positive conditional: 21, positive unconditional: 31801, negative: 312, negative conditional: 19, negative unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32134, positive: 31822, positive conditional: 21, positive unconditional: 31801, negative: 312, negative conditional: 19, negative unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25063, positive: 24836, positive conditional: 17, positive unconditional: 24819, negative: 227, negative conditional: 16, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25063, positive: 24509, positive conditional: 0, positive unconditional: 24509, negative: 554, negative conditional: 0, negative unconditional: 554, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 554, positive: 327, positive conditional: 17, positive unconditional: 310, negative: 227, negative conditional: 16, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 822, positive: 448, positive conditional: 59, positive unconditional: 389, negative: 374, negative conditional: 45, negative unconditional: 330, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32134, positive: 6986, positive conditional: 4, positive unconditional: 6982, negative: 85, negative conditional: 3, negative unconditional: 82, unknown: 25063, unknown conditional: 33, unknown unconditional: 25030] , Statistics on independence cache: Total cache size (in pairs): 25063, Positive cache size: 24836, Positive conditional cache size: 17, Positive unconditional cache size: 24819, Negative cache size: 227, Negative conditional cache size: 16, Negative unconditional cache size: 211, Eliminated conditions: 49, Maximal queried relation: 5, Independence queries for same thread: 187 - DataRaceFoundResult [Line: 812]: Data race detected Data race detected The following path leads to a data race: [L841] 0 static pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex={3:0}] [L1072] 0 pthread_t reader, writer; VAL [mutex={3:0}, reader={30:0}, writer={27:0}] [L1073] 0 Ring r; VAL [mutex={3:0}, r={29:0}, reader={30:0}, writer={27:0}] [L1074] CALL 0 ring_init( &r ) [L823] EXPR 0 r->writer = 0 VAL [mutex={3:0}, r={29:0}, r={29:0}, r->writer = 0=117] [L823] 0 r->reader = r->writer = 0 VAL [mutex={3:0}, r={29:0}, r={29:0}, r->reader = r->writer = 0=121, r->writer = 0=117] [L1074] RET 0 ring_init( &r ) [L1075] FCALL, FORK 0 pthread_create( &reader, ((void *)0), &reader_two, &r ) VAL [mutex={3:0}, pthread_create( &reader, ((void *)0), &reader_two, &r )=17, r={29:0}, reader={30:0}, writer={27:0}] [L1076] FCALL, FORK 0 pthread_create( &writer, ((void *)0), &writer_fn, &r ) VAL [mutex={3:0}, pthread_create( &writer, ((void *)0), &writer_fn, &r )=18, r={29:0}, reader={30:0}, writer={27:0}] [L842] 2 Ring *r = arg; VAL [arg={29:0}, arg={29:0}, mutex={3:0}, r={29:0}] [L843] 2 long i = 0; VAL [arg={29:0}, arg={29:0}, i=0, mutex={3:0}, r={29:0}] [L843] COND TRUE 2 i < 8 VAL [arg={29:0}, arg={29:0}, i=0, mutex={3:0}, r={29:0}] [L845] CALL 2 ring_enqueue( r, i + 1 ) [L810] EXPR 2 r->writer VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->writer=0, x=1] [L810] EXPR 2 r->writer + 1 VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->writer=0, x=1] [L810] EXPR 2 r->reader VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=0, x=1] [L810] 2 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=0, x=1] [L810] COND FALSE 2 !((r->writer + 1) % 4 == r->reader) VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=0, x=1] [L811] EXPR 2 r->writer VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->writer=0, x=1] [L811] EXPR 2 r->q[ r->writer ] VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->writer=0, x=1] [L811] 2 r->q[ r->writer ] = x VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->q[ r->writer ] = x=122, r->writer=0, x=1] [L812] EXPR 2 r->writer VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->writer=0, x=1] [L812] EXPR 2 r->writer + 1 VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->writer=0, x=1] [L812] 2 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r->writer=0, r->writer = (r->writer + 1) % 4=119, x=1] [L845] RET 2 ring_enqueue( r, i + 1 ) [L843] 2 ++i VAL [arg={29:0}, arg={29:0}, i=1, mutex={3:0}, r={29:0}] [L843] COND TRUE 2 i < 8 VAL [arg={29:0}, arg={29:0}, i=1, mutex={3:0}, r={29:0}] [L1077] CALL 0 writer_fn( &r ) [L842] 0 Ring *r = arg; VAL [arg={29:0}, arg={29:0}, arg={29:0}, arg={29:0}, i=1, mutex={3:0}, r={29:0}, r={29:0}] [L843] 0 long i = 0; VAL [arg={29:0}, arg={29:0}, arg={29:0}, arg={29:0}, i=0, i=1, mutex={3:0}, r={29:0}, r={29:0}] [L843] COND TRUE 0 i < 8 VAL [arg={29:0}, arg={29:0}, arg={29:0}, arg={29:0}, i=1, i=0, mutex={3:0}, r={29:0}, r={29:0}] [L845] CALL 0 ring_enqueue( r, i + 1 ) [L810] EXPR 0 r->writer VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=1, x=1, x=1] [L810] EXPR 0 r->writer + 1 VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=1, x=1, x=1] [L810] EXPR 0 r->reader VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=1, x=1, x=1] [L810] 0 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=1, x=1, x=1] [L810] COND FALSE 0 !((r->writer + 1) % 4 == r->reader) VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=1, x=1, x=1] [L811] EXPR 0 r->writer VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=1, x=1, x=1] [L811] EXPR 0 r->q[ r->writer ] VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=1, x=1, x=1] [L811] 0 r->q[ r->writer ] = x VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->q[ r->writer ] = x=120, r->writer=1, x=1, x=1] [L812] EXPR 0 r->writer VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=1, x=1, x=1] [L812] EXPR 0 r->writer + 1 VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=1, x=1, x=1] [L812] 0 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=1, r->writer = (r->writer + 1) % 4=118, x=1, x=1] [L845] RET 0 ring_enqueue( r, i + 1 ) [L845] CALL 2 ring_enqueue( r, i + 1 ) [L810] EXPR 2 r->writer VAL [\old(x)=2, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=2, x=2, x=1] [L810] EXPR 2 r->writer + 1 VAL [\old(x)=1, \old(x)=2, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=2, x=2, x=1] [L810] EXPR 2 r->reader VAL [\old(x)=1, \old(x)=2, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=2, x=2, x=1] [L810] 2 (r->writer + 1) % 4 == r->reader VAL [\old(x)=1, \old(x)=2, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=2, x=2, x=1] [L810] COND FALSE 2 !((r->writer + 1) % 4 == r->reader) VAL [\old(x)=1, \old(x)=2, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=2, x=1, x=2] [L811] EXPR 2 r->writer VAL [\old(x)=2, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=2, x=2, x=1] [L811] EXPR 2 r->q[ r->writer ] VAL [\old(x)=1, \old(x)=2, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=2, x=1, x=2] [L811] 2 r->q[ r->writer ] = x VAL [\old(x)=1, \old(x)=2, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->q[ r->writer ] = x=115, r->writer=2, x=2, x=1] [L812] EXPR 2 r->writer VAL [\old(x)=2, \old(x)=1, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=2, x=2, x=1] [L812] EXPR 2 r->writer + 1 VAL [\old(x)=1, \old(x)=2, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=2, x=2, x=1] [L812] 2 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, \old(x)=2, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=2, r->writer = (r->writer + 1) % 4=116, x=1, x=2] [L843] 0 ++i VAL [arg={29:0}, arg={29:0}, arg={29:0}, arg={29:0}, i=1, i=1, mutex={3:0}, r={29:0}, r={29:0}] [L843] COND TRUE 0 i < 8 VAL [arg={29:0}, arg={29:0}, arg={29:0}, arg={29:0}, i=1, i=1, mutex={3:0}, r={29:0}, r={29:0}] [L1053] 1 Ring *r = arg; VAL [arg={29:0}, arg={29:0}, mutex={3:0}, r={29:0}] [L1054] 1 long val = 0, i = 0; VAL [arg={29:0}, arg={29:0}, i=0, mutex={3:0}, r={29:0}, val=0] [L1055] 1 int read[ 8 ] = { 0 }; VAL [arg={29:0}, arg={29:0}, i=0, mutex={3:0}, r={29:0}, read={25:0}, val=0] [L1056] COND TRUE 1 i < 2 * 8 VAL [arg={29:0}, arg={29:0}, i=0, mutex={3:0}, r={29:0}, read={25:0}, val=0] [L1057] CALL 1 ring_empty( r ) [L820] EXPR 1 r->reader VAL [mutex={3:0}, r={29:0}, r={29:0}, r->reader=0] [L820] 1 r->reader == r->writer VAL [mutex={3:0}, r={29:0}, r={29:0}, r->reader=0] [L820] EXPR 1 r->writer VAL [mutex={3:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=3] [L820] 1 r->reader == r->writer VAL [mutex={3:0}, r={29:0}, r={29:0}, r->reader=0, r->writer=3] [L812] 2 r->writer = (r->writer + 1) % 4 VAL [\old(x)=1, \old(x)=2, mutex={3:0}, r={29:0}, r={29:0}, r={29:0}, r={29:0}, r->writer=2, r->writer = (r->writer + 1) % 4=116, x=1, x=2] 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) % 4 == r->reader [810] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->writer + 1 [810] * C: r->writer + 1 [812] * C: r->q[ r->writer ] = x [811] * C: r->writer + 1 [812] * C: r->reader = r->writer = 0 [823] * C: r->writer = 0 [823] * C: r->q[ r->writer ] = x [811] * C: r->reader == r->writer [820] * C: r->writer = 0 [823] * C: r->q[ r->writer ] [811] * C: r->q[ r->writer ] = x [811] * C: r->reader == r->writer [820] * C: r->q[ r->writer ] [811] * C: r->q[ r->writer ] [811] * C: r->reader = r->writer = 0 [823] * C: r->writer + 1 [810] * C: r->reader = r->writer = 0 [823] * C: r->reader == r->writer [820] * C: r->reader == r->writer [820] * C: r->reader = r->writer = 0 [823] * C: r->reader == r->writer [820] * C: r->writer + 1 [810] * C: r->writer = 0 [823] * C: r->q[ r->writer ] = x [811] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->writer = 0 [823] * C: (r->writer + 1) % 4 == r->reader [810] * C: r->q[ r->writer ] [811] * C: r->writer + 1 [812] * C: r->writer + 1 [812] * C: r->writer + 1 [810] 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_fnThread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 594 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 3.3s, 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: 70, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1697 NumberOfCodeBlocks, 1697 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1419 ConstructedInterpolants, 0 QuantifiedInterpolants, 7536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 107/155 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:30,025 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:30,221 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...