./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fea91513c96246b75c49fa902e51d33d0640cbe9a02143a9b8a08050c0f0b4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:28:03,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:28:03,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:28:03,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:28:03,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:28:03,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:28:03,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:28:03,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:28:03,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:28:03,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:28:03,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:28:03,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:28:03,440 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:28:03,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:28:03,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:28:03,440 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:28:03,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:28:03,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:28:03,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:28:03,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:28:03,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:28:03,441 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:28:03,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:28:03,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:28:03,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:28:03,442 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:28:03,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:28:03,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:28:03,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:28:03,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:28:03,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:28:03,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:28:03,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:28:03,443 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fea91513c96246b75c49fa902e51d33d0640cbe9a02143a9b8a08050c0f0b4f [2025-03-13 22:28:03,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:28:03,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:28:03,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:28:03,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:28:03,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:28:03,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init-race.i [2025-03-13 22:28:04,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee12af79/57976c5f74924b51a5f1f56a600b584d/FLAG98d886733 [2025-03-13 22:28:05,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:28:05,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init-race.i [2025-03-13 22:28:05,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee12af79/57976c5f74924b51a5f1f56a600b584d/FLAG98d886733 [2025-03-13 22:28:05,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee12af79/57976c5f74924b51a5f1f56a600b584d [2025-03-13 22:28:05,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:28:05,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:28:05,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:28:05,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:28:05,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:28:05,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334f722a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05, skipping insertion in model container [2025-03-13 22:28:05,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:28:05,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:28:05,455 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:28:05,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:28:05,524 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:28:05,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05 WrapperNode [2025-03-13 22:28:05,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:28:05,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:28:05,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:28:05,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:28:05,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,553 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-13 22:28:05,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:28:05,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:28:05,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:28:05,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:28:05,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,577 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:28:05,583 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:28:05,584 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:28:05,584 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:28:05,585 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (1/1) ... [2025-03-13 22:28:05,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:28:05,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:28:05,609 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) [2025-03-13 22:28:05,611 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 [2025-03-13 22:28:05,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:28:05,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:28:05,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:28:05,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:28:05,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:28:05,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:28:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:28:05,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:28:05,630 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:28:05,709 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:28:05,711 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:28:05,862 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:28:05,863 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:28:05,863 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:28:05,873 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:28:05,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:05 BoogieIcfgContainer [2025-03-13 22:28:05,874 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:28:05,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:28:05,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:28:05,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:28:05,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:28:05" (1/3) ... [2025-03-13 22:28:05,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d7ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:28:05, skipping insertion in model container [2025-03-13 22:28:05,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:05" (2/3) ... [2025-03-13 22:28:05,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d7ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:28:05, skipping insertion in model container [2025-03-13 22:28:05,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:05" (3/3) ... [2025-03-13 22:28:05,880 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-init-race.i [2025-03-13 22:28:05,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:28:05,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-init-race.i that has 2 procedures, 89 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-13 22:28:05,894 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:28:05,947 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:28:05,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 91 transitions, 189 flow [2025-03-13 22:28:06,027 INFO L124 PetriNetUnfolderBase]: 2/121 cut-off events. [2025-03-13 22:28:06,029 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:28:06,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 121 events. 2/121 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 157 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 56. Up to 3 conditions per place. [2025-03-13 22:28:06,032 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 91 transitions, 189 flow [2025-03-13 22:28:06,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 91 transitions, 189 flow [2025-03-13 22:28:06,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:28:06,053 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ffe5b8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:28:06,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 22:28:06,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:28:06,067 INFO L124 PetriNetUnfolderBase]: 1/51 cut-off events. [2025-03-13 22:28:06,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:28:06,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:06,068 INFO L206 CegarLoopForPetriNet]: 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] [2025-03-13 22:28:06,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-13 22:28:06,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2079339538, now seen corresponding path program 1 times [2025-03-13 22:28:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:06,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190398931] [2025-03-13 22:28:06,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:06,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:06,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:28:06,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:28:06,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:06,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:06,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:06,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190398931] [2025-03-13 22:28:06,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190398931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:06,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:06,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:06,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423494836] [2025-03-13 22:28:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:06,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:06,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:06,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:06,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:06,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 91 [2025-03-13 22:28:06,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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) [2025-03-13 22:28:06,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:06,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 91 [2025-03-13 22:28:06,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:07,051 INFO L124 PetriNetUnfolderBase]: 87/440 cut-off events. [2025-03-13 22:28:07,053 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:28:07,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 440 events. 87/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2133 event pairs, 51 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 579. Up to 187 conditions per place. [2025-03-13 22:28:07,057 INFO L140 encePairwiseOnDemand]: 79/91 looper letters, 27 selfloop transitions, 22 changer transitions 1/111 dead transitions. [2025-03-13 22:28:07,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 111 transitions, 327 flow [2025-03-13 22:28:07,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 423 transitions. [2025-03-13 22:28:07,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7747252747252747 [2025-03-13 22:28:07,068 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 189 flow. Second operand 6 states and 423 transitions. [2025-03-13 22:28:07,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 111 transitions, 327 flow [2025-03-13 22:28:07,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 111 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:07,075 INFO L231 Difference]: Finished difference. Result has 102 places, 110 transitions, 335 flow [2025-03-13 22:28:07,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=102, PETRI_TRANSITIONS=110} [2025-03-13 22:28:07,081 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 10 predicate places. [2025-03-13 22:28:07,082 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 110 transitions, 335 flow [2025-03-13 22:28:07,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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) [2025-03-13 22:28:07,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:07,082 INFO L206 CegarLoopForPetriNet]: 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] [2025-03-13 22:28:07,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:28:07,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-13 22:28:07,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash -432840147, now seen corresponding path program 1 times [2025-03-13 22:28:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:07,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543060917] [2025-03-13 22:28:07,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:07,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:07,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:28:07,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:28:07,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:07,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:07,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:07,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543060917] [2025-03-13 22:28:07,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543060917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:07,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:07,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529450333] [2025-03-13 22:28:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:07,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:28:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:07,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:28:07,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:28:07,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 91 [2025-03-13 22:28:07,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 110 transitions, 335 flow. Second operand has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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) [2025-03-13 22:28:07,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:07,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 91 [2025-03-13 22:28:07,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:07,333 INFO L124 PetriNetUnfolderBase]: 33/241 cut-off events. [2025-03-13 22:28:07,333 INFO L125 PetriNetUnfolderBase]: For 31/33 co-relation queries the response was YES. [2025-03-13 22:28:07,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 241 events. 33/241 cut-off events. For 31/33 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 695 event pairs, 0 based on Foata normal form. 1/228 useless extension candidates. Maximal degree in co-relation 310. Up to 45 conditions per place. [2025-03-13 22:28:07,338 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 11 selfloop transitions, 2 changer transitions 5/115 dead transitions. [2025-03-13 22:28:07,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 115 transitions, 381 flow [2025-03-13 22:28:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2025-03-13 22:28:07,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2025-03-13 22:28:07,342 INFO L175 Difference]: Start difference. First operand has 102 places, 110 transitions, 335 flow. Second operand 6 states and 481 transitions. [2025-03-13 22:28:07,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 115 transitions, 381 flow [2025-03-13 22:28:07,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 115 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:07,348 INFO L231 Difference]: Finished difference. Result has 110 places, 110 transitions, 353 flow [2025-03-13 22:28:07,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=110, PETRI_TRANSITIONS=110} [2025-03-13 22:28:07,349 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 18 predicate places. [2025-03-13 22:28:07,349 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 353 flow [2025-03-13 22:28:07,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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) [2025-03-13 22:28:07,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:07,350 INFO L206 CegarLoopForPetriNet]: 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] [2025-03-13 22:28:07,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:28:07,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-13 22:28:07,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:07,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1111777019, now seen corresponding path program 1 times [2025-03-13 22:28:07,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960626016] [2025-03-13 22:28:07,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:07,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:07,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:28:07,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:28:07,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:07,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:07,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:07,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960626016] [2025-03-13 22:28:07,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960626016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:07,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:07,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917792550] [2025-03-13 22:28:07,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:07,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:07,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:07,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:07,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2025-03-13 22:28:07,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 353 flow. Second operand has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 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) [2025-03-13 22:28:07,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:07,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2025-03-13 22:28:07,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:07,845 INFO L124 PetriNetUnfolderBase]: 106/639 cut-off events. [2025-03-13 22:28:07,846 INFO L125 PetriNetUnfolderBase]: For 144/175 co-relation queries the response was YES. [2025-03-13 22:28:07,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1241 conditions, 639 events. 106/639 cut-off events. For 144/175 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3719 event pairs, 12 based on Foata normal form. 4/611 useless extension candidates. Maximal degree in co-relation 1113. Up to 186 conditions per place. [2025-03-13 22:28:07,850 INFO L140 encePairwiseOnDemand]: 77/91 looper letters, 32 selfloop transitions, 47 changer transitions 0/153 dead transitions. [2025-03-13 22:28:07,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 153 transitions, 670 flow [2025-03-13 22:28:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2025-03-13 22:28:07,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-03-13 22:28:07,853 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 353 flow. Second operand 6 states and 493 transitions. [2025-03-13 22:28:07,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 153 transitions, 670 flow [2025-03-13 22:28:07,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 153 transitions, 656 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-13 22:28:07,859 INFO L231 Difference]: Finished difference. Result has 112 places, 152 transitions, 719 flow [2025-03-13 22:28:07,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=719, PETRI_PLACES=112, PETRI_TRANSITIONS=152} [2025-03-13 22:28:07,860 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 20 predicate places. [2025-03-13 22:28:07,860 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 152 transitions, 719 flow [2025-03-13 22:28:07,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 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) [2025-03-13 22:28:07,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:07,861 INFO L206 CegarLoopForPetriNet]: 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] [2025-03-13 22:28:07,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:28:07,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-13 22:28:07,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:07,861 INFO L85 PathProgramCache]: Analyzing trace with hash 937634358, now seen corresponding path program 1 times [2025-03-13 22:28:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:07,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040347775] [2025-03-13 22:28:07,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:07,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-13 22:28:07,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-13 22:28:07,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:07,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040347775] [2025-03-13 22:28:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040347775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:08,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:08,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769752780] [2025-03-13 22:28:08,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:08,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:08,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:08,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:08,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 91 [2025-03-13 22:28:08,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 152 transitions, 719 flow. Second operand has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 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) [2025-03-13 22:28:08,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:08,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 91 [2025-03-13 22:28:08,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:08,305 INFO L124 PetriNetUnfolderBase]: 186/810 cut-off events. [2025-03-13 22:28:08,305 INFO L125 PetriNetUnfolderBase]: For 635/663 co-relation queries the response was YES. [2025-03-13 22:28:08,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 810 events. 186/810 cut-off events. For 635/663 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4991 event pairs, 38 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 1976. Up to 391 conditions per place. [2025-03-13 22:28:08,310 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 83 selfloop transitions, 32 changer transitions 0/179 dead transitions. [2025-03-13 22:28:08,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 179 transitions, 1111 flow [2025-03-13 22:28:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 422 transitions. [2025-03-13 22:28:08,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7728937728937729 [2025-03-13 22:28:08,312 INFO L175 Difference]: Start difference. First operand has 112 places, 152 transitions, 719 flow. Second operand 6 states and 422 transitions. [2025-03-13 22:28:08,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 179 transitions, 1111 flow [2025-03-13 22:28:08,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 179 transitions, 1093 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:08,321 INFO L231 Difference]: Finished difference. Result has 122 places, 179 transitions, 1023 flow [2025-03-13 22:28:08,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1023, PETRI_PLACES=122, PETRI_TRANSITIONS=179} [2025-03-13 22:28:08,321 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 30 predicate places. [2025-03-13 22:28:08,322 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 179 transitions, 1023 flow [2025-03-13 22:28:08,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 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) [2025-03-13 22:28:08,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:08,322 INFO L206 CegarLoopForPetriNet]: 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] [2025-03-13 22:28:08,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:28:08,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-13 22:28:08,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash 122431298, now seen corresponding path program 1 times [2025-03-13 22:28:08,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:08,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154008501] [2025-03-13 22:28:08,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:08,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:08,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:28:08,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:28:08,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:08,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:08,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:28:08,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:28:08,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:28:08,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:08,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:08,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:28:08,388 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:28:08,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2025-03-13 22:28:08,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-03-13 22:28:08,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-03-13 22:28:08,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-03-13 22:28:08,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-13 22:28:08,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-03-13 22:28:08,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:28:08,390 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 22:28:08,419 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:28:08,419 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:28:08,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:28:08 BasicIcfg [2025-03-13 22:28:08,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:28:08,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:28:08,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:28:08,423 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:28:08,424 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:05" (3/4) ... [2025-03-13 22:28:08,425 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 22:28:08,465 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 5. [2025-03-13 22:28:08,497 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:28:08,498 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:28:08,498 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:28:08,499 INFO L158 Benchmark]: Toolchain (without parser) took 3390.93ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 121.9MB in the beginning and 259.0MB in the end (delta: -137.1MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2025-03-13 22:28:08,499 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:28:08,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.34ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 94.5MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 22:28:08,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.48ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 91.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:28:08,501 INFO L158 Benchmark]: Boogie Preprocessor took 29.48ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 90.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:28:08,502 INFO L158 Benchmark]: IcfgBuilder took 291.16ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 73.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:28:08,502 INFO L158 Benchmark]: TraceAbstraction took 2546.99ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 73.6MB in the beginning and 265.7MB in the end (delta: -192.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2025-03-13 22:28:08,504 INFO L158 Benchmark]: Witness Printer took 74.95ms. Allocated memory is still 377.5MB. Free memory was 265.7MB in the beginning and 259.0MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:28:08,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.34ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 94.5MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.48ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 91.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.48ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 90.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 291.16ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 73.6MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2546.99ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 73.6MB in the beginning and 265.7MB in the end (delta: -192.1MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Witness Printer took 74.95ms. Allocated memory is still 377.5MB. Free memory was 265.7MB in the beginning and 259.0MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1021]: Data race detected Data race detected The following path leads to a data race: [L1025] 0 int threads_total = __VERIFIER_nondet_int(); VAL [threads_total=1] [L1026] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1] [L1026] RET 0 assume_abort_if_not(threads_total >= 0) [L1027] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [threads_total=1, tids={-2:0}] [L1028] EXPR, FCALL 0 calloc(threads_total, sizeof(int)) [L1028] 0 int *is = calloc(threads_total, sizeof(int)); VAL [is={-3:0}, threads_total=1, tids={-2:0}] [L1029] 0 int i = 0; VAL [i=0, is={-3:0}, threads_total=1, tids={-2:0}] [L1029] COND TRUE 0 i < threads_total [L1030] 0 pthread_create(&tids[i], ((void *)0), &thread, &is[i]) VAL [i=0, is={-3:0}, threads_total=1, tids={-2:0}] [L1030] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, &is[i]) VAL [\old(arg)={-3:0}, i=0, is={-3:0}, threads_total=1, tids={-2:0}] [L1031] 0 is[i] = i VAL [\old(arg)={-3:0}, i=0, is={-3:0}, threads_total=1, tids={-2:0}] [L1020] 1 int *p = arg; VAL [\old(arg)={-3:0}, arg={-3:0}, p={-3:0}] [L1021] EXPR 1 \read(*p) VAL [\old(arg)={-3:0}, arg={-3:0}, p={-3:0}] [L1021] 1 int i = *p; VAL [\old(arg)={-3:0}, arg={-3:0}, p={-3:0}] [L1031] 0 is[i] = i VAL [\old(arg)={-3:0}, arg={-3:0}, i=0, is={-3:0}, p={-3:0}, threads_total=1, tids={-2:0}] [L1021] 1 int i = *p; VAL [\old(arg)={-3:0}, arg={-3:0}, p={-3:0}] 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: pthread_create(&tids[i], ((void *)0), &thread, &is[i]) [1030] * C: is[i] = i [1031] * C: pthread_create(&tids[i], ((void *)0), &thread, &is[i]) [1030] * C: pthread_create(&tids[i], ((void *)0), &thread, &is[i]) [1030] * C: pthread_create(&tids[i], ((void *)0), &thread, &is[i]) [1030] and C: int i = *p; [1021] - UnprovableResult [Line: 1030]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 104 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 236 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 714 IncrementalHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 21 mSDtfsCounter, 714 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-13 22:28:08,520 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(DATA-RACE)