./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_45-escape_rc.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/goblint-regression/04-mutex_45-escape_rc.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 305ca34367a0384e1cfb307304cf4f5bc67454529c9c0988e189092c0a2626a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:15:28,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:15:28,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:15:28,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:15:28,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:15:28,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:15:28,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:15:28,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:15:28,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:15:28,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:15:28,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:15:28,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:15:28,445 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:15:28,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:15:28,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:15:28,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:15:28,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:28,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:15:28,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:15:28,447 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 -> 305ca34367a0384e1cfb307304cf4f5bc67454529c9c0988e189092c0a2626a1 [2025-03-13 22:15:28,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:15:28,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:15:28,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:15:28,695 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:15:28,696 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:15:28,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_45-escape_rc.i [2025-03-13 22:15:29,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a552dc3/fea66fd7f613410b91f51a1cbf4f0fa1/FLAG8c0589f2e [2025-03-13 22:15:30,156 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:15:30,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_45-escape_rc.i [2025-03-13 22:15:30,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a552dc3/fea66fd7f613410b91f51a1cbf4f0fa1/FLAG8c0589f2e [2025-03-13 22:15:30,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a552dc3/fea66fd7f613410b91f51a1cbf4f0fa1 [2025-03-13 22:15:30,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:15:30,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:15:30,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:30,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:15:30,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:15:30,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ebc27bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30, skipping insertion in model container [2025-03-13 22:15:30,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:15:30,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:30,761 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:15:30,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:30,831 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:15:30,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30 WrapperNode [2025-03-13 22:15:30,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:30,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:30,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:15:30,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:15:30,837 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:15:30" (1/1) ... [2025-03-13 22:15:30,845 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:15:30" (1/1) ... [2025-03-13 22:15:30,859 INFO L138 Inliner]: procedures = 263, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2025-03-13 22:15:30,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:30,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:15:30,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:15:30,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:15:30,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:15:30,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:15:30,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:15:30,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:15:30,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (1/1) ... [2025-03-13 22:15:30,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:30,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:30,905 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:15:30,910 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:15:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:15:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:15:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:15:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:15:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:15:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:15:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:15:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:15:30,925 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:15:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:15:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:15:30,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:15:30,926 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:15:31,019 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:15:31,020 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:15:31,131 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-13 22:15:31,131 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L928-1: SUMMARY for call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset); srcloc: null [2025-03-13 22:15:31,165 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:15:31,165 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:15:31,165 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:15:31,187 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:15:31,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:31 BoogieIcfgContainer [2025-03-13 22:15:31,187 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:15:31,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:15:31,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:15:31,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:15:31,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:15:30" (1/3) ... [2025-03-13 22:15:31,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321c8f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:31, skipping insertion in model container [2025-03-13 22:15:31,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:30" (2/3) ... [2025-03-13 22:15:31,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321c8f77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:31, skipping insertion in model container [2025-03-13 22:15:31,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:31" (3/3) ... [2025-03-13 22:15:31,194 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_45-escape_rc.i [2025-03-13 22:15:31,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:15:31,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_45-escape_rc.i that has 2 procedures, 85 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-13 22:15:31,204 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:15:31,250 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:15:31,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 84 transitions, 175 flow [2025-03-13 22:15:31,311 INFO L124 PetriNetUnfolderBase]: 0/83 cut-off events. [2025-03-13 22:15:31,315 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:31,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 0/83 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-13 22:15:31,317 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 84 transitions, 175 flow [2025-03-13 22:15:31,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 76 transitions, 155 flow [2025-03-13 22:15:31,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:15:31,337 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;@62b473c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:15:31,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 22:15:31,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:15:31,351 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2025-03-13 22:15:31,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:15:31,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:31,352 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:15:31,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1522792936, now seen corresponding path program 1 times [2025-03-13 22:15:31,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:31,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666109080] [2025-03-13 22:15:31,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:31,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:31,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:15:31,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:15:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:31,963 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:15:31,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:31,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666109080] [2025-03-13 22:15:31,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666109080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635350490] [2025-03-13 22:15:31,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:31,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:31,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:31,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:31,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:32,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 84 [2025-03-13 22:15:32,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 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:15:32,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:32,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 84 [2025-03-13 22:15:32,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:32,296 INFO L124 PetriNetUnfolderBase]: 102/413 cut-off events. [2025-03-13 22:15:32,296 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:32,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 413 events. 102/413 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2025 event pairs, 52 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 618. Up to 181 conditions per place. [2025-03-13 22:15:32,299 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 28 selfloop transitions, 22 changer transitions 0/105 dead transitions. [2025-03-13 22:15:32,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 105 transitions, 313 flow [2025-03-13 22:15:32,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 423 transitions. [2025-03-13 22:15:32,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2025-03-13 22:15:32,315 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 155 flow. Second operand 6 states and 423 transitions. [2025-03-13 22:15:32,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 105 transitions, 313 flow [2025-03-13 22:15:32,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 105 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:32,323 INFO L231 Difference]: Finished difference. Result has 89 places, 97 transitions, 304 flow [2025-03-13 22:15:32,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=89, PETRI_TRANSITIONS=97} [2025-03-13 22:15:32,330 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places. [2025-03-13 22:15:32,330 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 97 transitions, 304 flow [2025-03-13 22:15:32,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 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:15:32,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:32,330 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:15:32,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:15:32,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:32,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash -579815649, now seen corresponding path program 1 times [2025-03-13 22:15:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243129406] [2025-03-13 22:15:32,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:32,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:15:32,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:15:32,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:32,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:32,549 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:15:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243129406] [2025-03-13 22:15:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243129406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:32,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984852535] [2025-03-13 22:15:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:32,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:32,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:32,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 84 [2025-03-13 22:15:32,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 97 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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:15:32,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:32,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 84 [2025-03-13 22:15:32,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:32,808 INFO L124 PetriNetUnfolderBase]: 133/500 cut-off events. [2025-03-13 22:15:32,808 INFO L125 PetriNetUnfolderBase]: For 116/126 co-relation queries the response was YES. [2025-03-13 22:15:32,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 500 events. 133/500 cut-off events. For 116/126 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2732 event pairs, 40 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 932. Up to 221 conditions per place. [2025-03-13 22:15:32,811 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 42 selfloop transitions, 26 changer transitions 0/126 dead transitions. [2025-03-13 22:15:32,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 126 transitions, 516 flow [2025-03-13 22:15:32,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 406 transitions. [2025-03-13 22:15:32,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2025-03-13 22:15:32,813 INFO L175 Difference]: Start difference. First operand has 89 places, 97 transitions, 304 flow. Second operand 6 states and 406 transitions. [2025-03-13 22:15:32,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 126 transitions, 516 flow [2025-03-13 22:15:32,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 126 transitions, 516 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:32,816 INFO L231 Difference]: Finished difference. Result has 99 places, 118 transitions, 488 flow [2025-03-13 22:15:32,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=99, PETRI_TRANSITIONS=118} [2025-03-13 22:15:32,817 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places. [2025-03-13 22:15:32,817 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 118 transitions, 488 flow [2025-03-13 22:15:32,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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:15:32,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:32,817 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] [2025-03-13 22:15:32,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:15:32,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:32,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash -599859988, now seen corresponding path program 1 times [2025-03-13 22:15:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:32,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515789203] [2025-03-13 22:15:32,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:32,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 22:15:32,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 22:15:32,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:32,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:33,040 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:15:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515789203] [2025-03-13 22:15:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515789203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:33,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:33,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715797823] [2025-03-13 22:15:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:33,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:33,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:33,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:33,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 84 [2025-03-13 22:15:33,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 118 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 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:15:33,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:33,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 84 [2025-03-13 22:15:33,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:33,283 INFO L124 PetriNetUnfolderBase]: 267/876 cut-off events. [2025-03-13 22:15:33,283 INFO L125 PetriNetUnfolderBase]: For 532/549 co-relation queries the response was YES. [2025-03-13 22:15:33,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2147 conditions, 876 events. 267/876 cut-off events. For 532/549 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5259 event pairs, 81 based on Foata normal form. 2/832 useless extension candidates. Maximal degree in co-relation 2108. Up to 476 conditions per place. [2025-03-13 22:15:33,289 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 66 selfloop transitions, 53 changer transitions 4/173 dead transitions. [2025-03-13 22:15:33,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 173 transitions, 978 flow [2025-03-13 22:15:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2025-03-13 22:15:33,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8115079365079365 [2025-03-13 22:15:33,290 INFO L175 Difference]: Start difference. First operand has 99 places, 118 transitions, 488 flow. Second operand 6 states and 409 transitions. [2025-03-13 22:15:33,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 173 transitions, 978 flow [2025-03-13 22:15:33,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 173 transitions, 978 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:33,296 INFO L231 Difference]: Finished difference. Result has 109 places, 165 transitions, 970 flow [2025-03-13 22:15:33,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=970, PETRI_PLACES=109, PETRI_TRANSITIONS=165} [2025-03-13 22:15:33,297 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 29 predicate places. [2025-03-13 22:15:33,297 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 165 transitions, 970 flow [2025-03-13 22:15:33,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 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:15:33,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:33,297 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] [2025-03-13 22:15:33,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:15:33,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:33,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -698258709, now seen corresponding path program 1 times [2025-03-13 22:15:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:33,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405667813] [2025-03-13 22:15:33,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:33,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 22:15:33,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 22:15:33,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:33,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:33,525 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:15:33,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:33,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405667813] [2025-03-13 22:15:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405667813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:33,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:33,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863031781] [2025-03-13 22:15:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:33,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:33,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:33,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:33,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 84 [2025-03-13 22:15:33,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 165 transitions, 970 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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:15:33,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:33,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 84 [2025-03-13 22:15:33,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:33,922 INFO L124 PetriNetUnfolderBase]: 358/1108 cut-off events. [2025-03-13 22:15:33,923 INFO L125 PetriNetUnfolderBase]: For 1450/1486 co-relation queries the response was YES. [2025-03-13 22:15:33,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1108 events. 358/1108 cut-off events. For 1450/1486 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7050 event pairs, 77 based on Foata normal form. 3/1077 useless extension candidates. Maximal degree in co-relation 3264. Up to 593 conditions per place. [2025-03-13 22:15:33,934 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 104 selfloop transitions, 61 changer transitions 10/226 dead transitions. [2025-03-13 22:15:33,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 226 transitions, 1666 flow [2025-03-13 22:15:33,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 392 transitions. [2025-03-13 22:15:33,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-03-13 22:15:33,936 INFO L175 Difference]: Start difference. First operand has 109 places, 165 transitions, 970 flow. Second operand 6 states and 392 transitions. [2025-03-13 22:15:33,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 226 transitions, 1666 flow [2025-03-13 22:15:33,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 226 transitions, 1602 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:33,954 INFO L231 Difference]: Finished difference. Result has 119 places, 212 transitions, 1492 flow [2025-03-13 22:15:33,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=119, PETRI_TRANSITIONS=212} [2025-03-13 22:15:33,955 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 39 predicate places. [2025-03-13 22:15:33,956 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 212 transitions, 1492 flow [2025-03-13 22:15:33,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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:15:33,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:33,956 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] [2025-03-13 22:15:33,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:15:33,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:33,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:33,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1737283168, now seen corresponding path program 1 times [2025-03-13 22:15:33,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:33,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035090626] [2025-03-13 22:15:33,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:33,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:15:33,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:15:33,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:33,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:15:33,990 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:15:33,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 22:15:34,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 22:15:34,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:34,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:15:34,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:15:34,024 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:15:34,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-13 22:15:34,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-13 22:15:34,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-13 22:15:34,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-13 22:15:34,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-13 22:15:34,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-13 22:15:34,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-13 22:15:34,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:15:34,026 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 22:15:34,066 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:15:34,066 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:15:34,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:15:34 BasicIcfg [2025-03-13 22:15:34,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:15:34,070 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:15:34,070 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:15:34,070 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:15:34,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:31" (3/4) ... [2025-03-13 22:15:34,071 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 22:15:34,121 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-03-13 22:15:34,151 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:15:34,154 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:15:34,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:15:34,154 INFO L158 Benchmark]: Toolchain (without parser) took 3732.75ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 121.7MB in the beginning and 206.4MB in the end (delta: -84.6MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. [2025-03-13 22:15:34,155 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:34,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.83ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 94.2MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 22:15:34,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.75ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 92.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:15:34,155 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 90.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:15:34,155 INFO L158 Benchmark]: IcfgBuilder took 308.16ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 74.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:15:34,155 INFO L158 Benchmark]: TraceAbstraction took 2880.75ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 74.1MB in the beginning and 214.7MB in the end (delta: -140.6MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2025-03-13 22:15:34,157 INFO L158 Benchmark]: Witness Printer took 83.48ms. Allocated memory is still 377.5MB. Free memory was 214.7MB in the beginning and 206.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:15:34,158 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.98ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.83ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 94.2MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.75ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 92.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 90.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 308.16ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 74.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2880.75ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 74.1MB in the beginning and 214.7MB in the end (delta: -140.6MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 83.48ms. Allocated memory is still 377.5MB. Free memory was 214.7MB in the beginning and 206.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 931]: Data race detected Data race detected The following path leads to a data race: [L917] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}] [L918] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, mutex2={2:0}] [L927] 0 pthread_t id; VAL [mutex1={1:0}, mutex2={2:0}] [L928] 0 int i; VAL [i={5:0}, mutex1={1:0}, mutex2={2:0}] [L929] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, (void *) &i) VAL [\old(arg)={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}] [L920] 1 int *p = (int *) arg; VAL [\old(arg)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] EXPR 1 \read(*p) VAL [\old(arg)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\old(arg)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] EXPR 0 \read(i) VAL [\old(arg)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] 0 i++ VAL [\old(arg)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\old(arg)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] 0 i++ VAL [\old(arg)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\old(arg)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] 0 i++ VAL [\old(arg)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\old(arg)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] 0 i++ VAL [\old(arg)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\old(arg)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] 0 i++ VAL [\old(arg)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] Now there is a data race (on the heap) between C: (*p)++ [922] and C: i++ [931] - UnprovableResult [Line: 931]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 929]: 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: 922]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 922]: 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, 114 locations, 7 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.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 809 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 5 mSDtfsCounter, 809 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=1492occurred 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.1s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 472 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:15:34,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)