./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/03-practical_08-nonterm1.yml/witness.graphml --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 194c01fd Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/03-practical_08-nonterm1.yml/witness.graphml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.5-dev-194c01f-m [2024-10-29 15:22:31,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:22:31,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:22:31,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:22:31,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:22:31,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:22:31,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:22:31,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:22:31,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:22:31,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:22:31,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:22:31,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:22:31,212 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:22:31,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:22:31,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:22:31,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:22:31,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:22:31,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:22:31,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:22:31,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:22:31,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:22:31,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:22:31,221 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:22:31,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:22:31,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:22:31,222 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:22:31,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:22:31,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:22:31,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:22:31,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:22:31,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:22:31,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:22:31,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:22:31,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:22:31,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:22:31,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:22:31,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:22:31,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:22:31,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:22:31,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:22:31,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:22:31,228 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-10-29 15:22:31,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:22:31,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:22:31,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:22:31,495 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:22:31,495 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:22:31,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/03-practical_08-nonterm1.yml/witness.graphml [2024-10-29 15:22:31,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:22:31,558 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:22:31,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i [2024-10-29 15:22:32,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:22:33,227 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:22:33,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/03-practical_08-nonterm1.i [2024-10-29 15:22:33,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57060da70/4c39e5b34adf45399374c46c9754d7dd/FLAG0ef111bef [2024-10-29 15:22:33,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57060da70/4c39e5b34adf45399374c46c9754d7dd [2024-10-29 15:22:33,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:22:33,538 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:22:33,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:22:33,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:22:33,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:22:33,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:31" (1/2) ... [2024-10-29 15:22:33,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5421b607 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:22:33, skipping insertion in model container [2024-10-29 15:22:33,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:31" (1/2) ... [2024-10-29 15:22:33,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@59635ee9 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:22:33, skipping insertion in model container [2024-10-29 15:22:33,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:22:33" (2/2) ... [2024-10-29 15:22:33,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5421b607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:33, skipping insertion in model container [2024-10-29 15:22:33,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:22:33" (2/2) ... [2024-10-29 15:22:33,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:22:34,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:22:34,084 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:22:34,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:22:34,204 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:22:34,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34 WrapperNode [2024-10-29 15:22:34,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:22:34,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:22:34,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:22:34,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:22:34,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,262 INFO L138 Inliner]: procedures = 264, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 86 [2024-10-29 15:22:34,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:22:34,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:22:34,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:22:34,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:22:34,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:22:34,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:22:34,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:22:34,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:22:34,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (1/1) ... [2024-10-29 15:22:34,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:22:34,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:22:34,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-29 15:22:34,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-29 15:22:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-29 15:22:34,403 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-29 15:22:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:22:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-29 15:22:34,404 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-29 15:22:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:22:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:22:34,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:22:34,406 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-29 15:22:34,545 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:22:34,546 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:22:34,712 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:22:34,712 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:22:34,739 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:22:34,739 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-29 15:22:34,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:22:34 BoogieIcfgContainer [2024-10-29 15:22:34,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:22:34,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:22:34,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:22:34,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:22:34,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:22:31" (1/4) ... [2024-10-29 15:22:34,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d78cfe and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:22:34, skipping insertion in model container [2024-10-29 15:22:34,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:22:33" (2/4) ... [2024-10-29 15:22:34,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d78cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:22:34, skipping insertion in model container [2024-10-29 15:22:34,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:22:34" (3/4) ... [2024-10-29 15:22:34,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d78cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:22:34, skipping insertion in model container [2024-10-29 15:22:34,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:22:34" (4/4) ... [2024-10-29 15:22:34,753 INFO L112 eAbstractionObserver]: Analyzing ICFG 03-practical_08-nonterm1.i [2024-10-29 15:22:34,753 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:22:34,807 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:22:34,807 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-29 15:22:34,807 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:22:34,895 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-29 15:22:34,915 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:22:34,927 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 90 transitions, 187 flow [2024-10-29 15:22:34,992 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 652 states, 637 states have (on average 1.967032967032967) internal successors, (1253), 651 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:22:35,039 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e57e8fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:22:35,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-29 15:22:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 652 states, 637 states have (on average 1.967032967032967) internal successors, (1253), 651 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-29 15:22:35,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:35,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:35,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-29 15:22:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2029843217, now seen corresponding path program 1 times [2024-10-29 15:22:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656195146] [2024-10-29 15:22:35,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:35,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:35,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656195146] [2024-10-29 15:22:35,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656195146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:35,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:35,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:35,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37188032] [2024-10-29 15:22:35,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:35,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:35,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:35,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:35,399 INFO L87 Difference]: Start difference. First operand has 652 states, 637 states have (on average 1.967032967032967) internal successors, (1253), 651 states have internal predecessors, (1253), 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) Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:35,531 INFO L93 Difference]: Finished difference Result 821 states and 1588 transitions. [2024-10-29 15:22:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:35,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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) Word has length 29 [2024-10-29 15:22:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:35,555 INFO L225 Difference]: With dead ends: 821 [2024-10-29 15:22:35,555 INFO L226 Difference]: Without dead ends: 664 [2024-10-29 15:22:35,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:35,562 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 41 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:35,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 136 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:22:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-29 15:22:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 565. [2024-10-29 15:22:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 555 states have (on average 1.9117117117117117) internal successors, (1061), 564 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1061 transitions. [2024-10-29 15:22:35,640 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1061 transitions. Word has length 29 [2024-10-29 15:22:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:35,641 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 1061 transitions. [2024-10-29 15:22:35,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1061 transitions. [2024-10-29 15:22:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-29 15:22:35,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:35,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:35,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:22:35,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-29 15:22:35,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash 70907826, now seen corresponding path program 1 times [2024-10-29 15:22:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237490877] [2024-10-29 15:22:35,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:35,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:35,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237490877] [2024-10-29 15:22:35,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237490877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:35,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:35,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:35,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926149144] [2024-10-29 15:22:35,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:35,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:35,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:35,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:35,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:35,722 INFO L87 Difference]: Start difference. First operand 565 states and 1061 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:35,795 INFO L93 Difference]: Finished difference Result 594 states and 1115 transitions. [2024-10-29 15:22:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:35,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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) Word has length 33 [2024-10-29 15:22:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:35,801 INFO L225 Difference]: With dead ends: 594 [2024-10-29 15:22:35,801 INFO L226 Difference]: Without dead ends: 577 [2024-10-29 15:22:35,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:35,803 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:35,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:22:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-29 15:22:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 567. [2024-10-29 15:22:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 558 states have (on average 1.906810035842294) internal successors, (1064), 566 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1064 transitions. [2024-10-29 15:22:35,843 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1064 transitions. Word has length 33 [2024-10-29 15:22:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:35,844 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 1064 transitions. [2024-10-29 15:22:35,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1064 transitions. [2024-10-29 15:22:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:22:35,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:35,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:35,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:22:35,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-29 15:22:35,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash 847630780, now seen corresponding path program 1 times [2024-10-29 15:22:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790317123] [2024-10-29 15:22:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:35,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:35,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:35,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790317123] [2024-10-29 15:22:35,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790317123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:35,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:35,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:35,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698479696] [2024-10-29 15:22:35,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:35,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:35,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:35,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:35,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:35,904 INFO L87 Difference]: Start difference. First operand 567 states and 1064 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:35,975 INFO L93 Difference]: Finished difference Result 642 states and 1204 transitions. [2024-10-29 15:22:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:35,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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) Word has length 34 [2024-10-29 15:22:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:35,980 INFO L225 Difference]: With dead ends: 642 [2024-10-29 15:22:35,981 INFO L226 Difference]: Without dead ends: 544 [2024-10-29 15:22:35,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:35,986 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 32 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:35,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 133 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:22:35,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-10-29 15:22:36,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 522. [2024-10-29 15:22:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 516 states have (on average 1.8565891472868217) internal successors, (958), 521 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 958 transitions. [2024-10-29 15:22:36,004 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 958 transitions. Word has length 34 [2024-10-29 15:22:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:36,005 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 958 transitions. [2024-10-29 15:22:36,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 958 transitions. [2024-10-29 15:22:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-29 15:22:36,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:36,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:36,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:22:36,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-29 15:22:36,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash -688749802, now seen corresponding path program 1 times [2024-10-29 15:22:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:36,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397343589] [2024-10-29 15:22:36,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:36,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397343589] [2024-10-29 15:22:36,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397343589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:36,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:36,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-29 15:22:36,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656831542] [2024-10-29 15:22:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:36,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:36,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:36,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:36,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:36,203 INFO L87 Difference]: Start difference. First operand 522 states and 958 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:36,237 INFO L93 Difference]: Finished difference Result 754 states and 1373 transitions. [2024-10-29 15:22:36,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:36,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) Word has length 38 [2024-10-29 15:22:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:36,240 INFO L225 Difference]: With dead ends: 754 [2024-10-29 15:22:36,241 INFO L226 Difference]: Without dead ends: 356 [2024-10-29 15:22:36,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:36,246 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:36,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 123 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-29 15:22:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2024-10-29 15:22:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 352 states have (on average 1.75) internal successors, (616), 355 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 616 transitions. [2024-10-29 15:22:36,283 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 616 transitions. Word has length 38 [2024-10-29 15:22:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:36,283 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 616 transitions. [2024-10-29 15:22:36,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 616 transitions. [2024-10-29 15:22:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-29 15:22:36,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:36,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:36,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:22:36,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-29 15:22:36,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash 814092668, now seen corresponding path program 1 times [2024-10-29 15:22:36,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:36,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345107934] [2024-10-29 15:22:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:36,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:36,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345107934] [2024-10-29 15:22:36,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345107934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:36,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:36,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:36,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590954269] [2024-10-29 15:22:36,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:36,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:36,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:36,391 INFO L87 Difference]: Start difference. First operand 356 states and 616 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:36,443 INFO L93 Difference]: Finished difference Result 372 states and 637 transitions. [2024-10-29 15:22:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:36,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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) Word has length 49 [2024-10-29 15:22:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:36,446 INFO L225 Difference]: With dead ends: 372 [2024-10-29 15:22:36,446 INFO L226 Difference]: Without dead ends: 258 [2024-10-29 15:22:36,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:36,447 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:36,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-29 15:22:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-29 15:22:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 256 states have (on average 1.66796875) internal successors, (427), 257 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 427 transitions. [2024-10-29 15:22:36,455 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 427 transitions. Word has length 49 [2024-10-29 15:22:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:36,455 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 427 transitions. [2024-10-29 15:22:36,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 427 transitions. [2024-10-29 15:22:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-29 15:22:36,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:36,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:36,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:22:36,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-29 15:22:36,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash -687743512, now seen corresponding path program 1 times [2024-10-29 15:22:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140592679] [2024-10-29 15:22:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:22:36,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:22:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:22:36,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:22:36,537 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:22:36,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2024-10-29 15:22:36,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-29 15:22:36,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-29 15:22:36,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 12 remaining) [2024-10-29 15:22:36,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-29 15:22:36,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-29 15:22:36,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-29 15:22:36,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-29 15:22:36,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-29 15:22:36,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-29 15:22:36,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-29 15:22:36,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-29 15:22:36,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:22:36,546 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-29 15:22:36,598 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-29 15:22:36,598 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-29 15:22:36,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:22:36 BasicIcfg [2024-10-29 15:22:36,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-29 15:22:36,604 INFO L158 Benchmark]: Toolchain (without parser) took 3066.37ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 93.0MB in the beginning and 139.4MB in the end (delta: -46.5MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-10-29 15:22:36,604 INFO L158 Benchmark]: Witness Parser took 0.27ms. Allocated memory is still 153.1MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:22:36,604 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:22:36,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.51ms. Allocated memory is still 153.1MB. Free memory was 93.0MB in the beginning and 61.3MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-29 15:22:36,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.56ms. Allocated memory is still 153.1MB. Free memory was 61.3MB in the beginning and 58.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-29 15:22:36,605 INFO L158 Benchmark]: Boogie Preprocessor took 42.04ms. Allocated memory is still 153.1MB. Free memory was 58.5MB in the beginning and 57.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:22:36,605 INFO L158 Benchmark]: RCFGBuilder took 433.88ms. Allocated memory is still 153.1MB. Free memory was 57.3MB in the beginning and 41.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-29 15:22:36,606 INFO L158 Benchmark]: TraceAbstraction took 1861.41ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 41.1MB in the beginning and 139.4MB in the end (delta: -98.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:22:36,607 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.27ms. Allocated memory is still 153.1MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 666.51ms. Allocated memory is still 153.1MB. Free memory was 93.0MB in the beginning and 61.3MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.56ms. Allocated memory is still 153.1MB. Free memory was 61.3MB in the beginning and 58.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.04ms. Allocated memory is still 153.1MB. Free memory was 58.5MB in the beginning and 57.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 433.88ms. Allocated memory is still 153.1MB. Free memory was 57.3MB in the beginning and 41.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1861.41ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 41.1MB in the beginning and 139.4MB in the end (delta: -98.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 939]: Data race detected Data race detected The following path leads to a data race: [L918] 0 int myglobal; VAL [myglobal=0] [L919] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, myglobal=0] [L920] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, mutex2={2:0}, myglobal=0] [L936] 0 pthread_t id; VAL [mutex1={1:0}, mutex2={2:0}, myglobal=0] [L937] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [id=-1, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L930] EXPR 1 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L930] 1 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L932] CALL 1 fun() [L922] 1 int i = __VERIFIER_nondet_int(); VAL [i=0, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L924] EXPR 1 myglobal+1 VAL [i=0, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L924] 1 myglobal=myglobal+1 VAL [i=0, mutex1={1:0}, mutex2={2:0}, myglobal=2] [L939] 0 myglobal+1 VAL [id=-1, mutex1={1:0}, mutex2={2:0}, myglobal=2] [L939] 0 myglobal+1 VAL [id=-1, mutex1={1:0}, mutex2={2:0}, myglobal=2] Now there is a data race on ~myglobal~0 between C: myglobal=myglobal+1 [924] and C: myglobal+1 [939] - UnprovableResult [Line: 939]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 942]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 937]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 930]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 924]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 924]: 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 with 1 thread instances CFG has 3 procedures, 129 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 631 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 229 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 402 mSDtfsCounter, 191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 131 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-29 15:22:36,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE