./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_09-tricky_address4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_09-tricky_address4.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 e3884759389c7a3b94642e5e46b4f06a5e829be11d2d026f21d000ba598ae6cd --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:41,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:41,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:41,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:41,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:41,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:41,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:41,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:41,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:41,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:41,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:41,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:41,431 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:41,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:41,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:41,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:41,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:41,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:41,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:41,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:41,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:41,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:41,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:41,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:41,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:41,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:41,434 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:41,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:41,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:41,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:41,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:41,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:41,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:41,434 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 -> e3884759389c7a3b94642e5e46b4f06a5e829be11d2d026f21d000ba598ae6cd [2025-04-30 10:26:41,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:41,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:41,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:41,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:41,685 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:41,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_09-tricky_address4.i [2025-04-30 10:26:42,987 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6206e7c0/6da50a481ca24c7d9ecd3fc2269064fa/FLAG9adc00639 [2025-04-30 10:26:43,242 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:43,243 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_09-tricky_address4.i [2025-04-30 10:26:43,256 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6206e7c0/6da50a481ca24c7d9ecd3fc2269064fa/FLAG9adc00639 [2025-04-30 10:26:43,988 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6206e7c0/6da50a481ca24c7d9ecd3fc2269064fa [2025-04-30 10:26:43,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:43,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:43,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:43,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:43,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:43,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:43,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7513d7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:43, skipping insertion in model container [2025-04-30 10:26:43,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:43" (1/1) ... [2025-04-30 10:26:44,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:44,406 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:44,432 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:44,474 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:44,515 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:44,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44 WrapperNode [2025-04-30 10:26:44,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:44,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:44,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:44,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:44,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,566 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2025-04-30 10:26:44,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:44,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:44,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:44,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:44,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,585 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:44,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:44,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:44,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:44,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:44,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:44,623 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-04-30 10:26:44,625 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-04-30 10:26:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:44,640 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:44,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:44,641 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:44,752 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:44,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:45,026 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:45,026 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:45,048 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:45,048 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:45,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:45 BoogieIcfgContainer [2025-04-30 10:26:45,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:45,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:45,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:45,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:45,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:43" (1/3) ... [2025-04-30 10:26:45,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1b5ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:45, skipping insertion in model container [2025-04-30 10:26:45,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44" (2/3) ... [2025-04-30 10:26:45,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1b5ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:45, skipping insertion in model container [2025-04-30 10:26:45,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:45" (3/3) ... [2025-04-30 10:26:45,058 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_09-tricky_address4.i [2025-04-30 10:26:45,068 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:45,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_09-tricky_address4.i that has 2 procedures, 161 locations, 162 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-30 10:26:45,070 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:45,131 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:45,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 163 transitions, 330 flow [2025-04-30 10:26:45,237 INFO L116 PetriNetUnfolderBase]: 3/162 cut-off events. [2025-04-30 10:26:45,240 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:45,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 162 events. 3/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-04-30 10:26:45,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 163 transitions, 330 flow [2025-04-30 10:26:45,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 162 transitions, 327 flow [2025-04-30 10:26:45,259 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:45,267 INFO L340 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;@2fd6210, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:45,268 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:26:45,303 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:45,303 INFO L116 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-04-30 10:26:45,303 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:45,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:45,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:26:45,304 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:45,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1944549468, now seen corresponding path program 1 times [2025-04-30 10:26:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:45,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483169306] [2025-04-30 10:26:45,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:45,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:45,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-04-30 10:26:45,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-04-30 10:26:45,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:45,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:45,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:45,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483169306] [2025-04-30 10:26:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483169306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:45,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:45,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:26:45,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563771659] [2025-04-30 10:26:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:45,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:45,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:45,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:45,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:45,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 163 [2025-04-30 10:26:45,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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-04-30 10:26:45,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:45,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 163 [2025-04-30 10:26:45,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:45,792 INFO L116 PetriNetUnfolderBase]: 7/224 cut-off events. [2025-04-30 10:26:45,792 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:45,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 224 events. 7/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 329 event pairs, 6 based on Foata normal form. 5/217 useless extension candidates. Maximal degree in co-relation 147. Up to 24 conditions per place. [2025-04-30 10:26:45,795 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 10 selfloop transitions, 2 changer transitions 1/161 dead transitions. [2025-04-30 10:26:45,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 349 flow [2025-04-30 10:26:45,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-04-30 10:26:45,805 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.950920245398773 [2025-04-30 10:26:45,807 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 327 flow. Second operand 3 states and 465 transitions. [2025-04-30 10:26:45,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 349 flow [2025-04-30 10:26:45,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:45,815 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 332 flow [2025-04-30 10:26:45,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-04-30 10:26:45,821 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 2 predicate places. [2025-04-30 10:26:45,822 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 332 flow [2025-04-30 10:26:45,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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-04-30 10:26:45,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:45,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:26:45,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:45,823 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:45,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:45,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1977463037, now seen corresponding path program 1 times [2025-04-30 10:26:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:45,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706814899] [2025-04-30 10:26:45,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:45,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:45,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-30 10:26:45,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-30 10:26:45,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:45,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:46,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:46,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706814899] [2025-04-30 10:26:46,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706814899] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:46,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201666027] [2025-04-30 10:26:46,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:46,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:46,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:46,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:46,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:26:46,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-04-30 10:26:46,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-04-30 10:26:46,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:46,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:46,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:26:46,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:46,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201666027] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:46,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:46,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:26:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408843142] [2025-04-30 10:26:46,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:46,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:26:46,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:46,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:26:46,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:26:46,225 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-04-30 10:26:46,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 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-04-30 10:26:46,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:46,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-04-30 10:26:46,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:46,304 INFO L116 PetriNetUnfolderBase]: 7/230 cut-off events. [2025-04-30 10:26:46,304 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:46,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 230 events. 7/230 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 322 event pairs, 6 based on Foata normal form. 2/221 useless extension candidates. Maximal degree in co-relation 194. Up to 24 conditions per place. [2025-04-30 10:26:46,306 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 14 selfloop transitions, 9 changer transitions 0/168 dead transitions. [2025-04-30 10:26:46,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 396 flow [2025-04-30 10:26:46,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:26:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:26:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2025-04-30 10:26:46,310 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9188820722563054 [2025-04-30 10:26:46,310 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 332 flow. Second operand 9 states and 1348 transitions. [2025-04-30 10:26:46,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 396 flow [2025-04-30 10:26:46,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:46,313 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 380 flow [2025-04-30 10:26:46,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=174, PETRI_TRANSITIONS=166} [2025-04-30 10:26:46,314 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 11 predicate places. [2025-04-30 10:26:46,314 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 380 flow [2025-04-30 10:26:46,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 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-04-30 10:26:46,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:46,315 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:26:46,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:26:46,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:46,520 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:46,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:46,521 INFO L85 PathProgramCache]: Analyzing trace with hash 288053341, now seen corresponding path program 2 times [2025-04-30 10:26:46,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:46,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705287385] [2025-04-30 10:26:46,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:46,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:46,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-04-30 10:26:46,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-04-30 10:26:46,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:46,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-30 10:26:47,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:47,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705287385] [2025-04-30 10:26:47,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705287385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:47,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:47,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:47,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043415418] [2025-04-30 10:26:47,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:47,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:47,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:47,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:47,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:47,687 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 163 [2025-04-30 10:26:47,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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-04-30 10:26:47,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:47,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 163 [2025-04-30 10:26:47,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:47,880 INFO L116 PetriNetUnfolderBase]: 129/671 cut-off events. [2025-04-30 10:26:47,881 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:26:47,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 671 events. 129/671 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3471 event pairs, 46 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 888. Up to 178 conditions per place. [2025-04-30 10:26:47,887 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 43 selfloop transitions, 22 changer transitions 0/207 dead transitions. [2025-04-30 10:26:47,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 207 transitions, 592 flow [2025-04-30 10:26:47,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 888 transitions. [2025-04-30 10:26:47,892 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9079754601226994 [2025-04-30 10:26:47,892 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 380 flow. Second operand 6 states and 888 transitions. [2025-04-30 10:26:47,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 207 transitions, 592 flow [2025-04-30 10:26:47,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 207 transitions, 586 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:47,898 INFO L231 Difference]: Finished difference. Result has 182 places, 188 transitions, 520 flow [2025-04-30 10:26:47,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=182, PETRI_TRANSITIONS=188} [2025-04-30 10:26:47,900 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 19 predicate places. [2025-04-30 10:26:47,900 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 188 transitions, 520 flow [2025-04-30 10:26:47,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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-04-30 10:26:47,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:47,901 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:26:47,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:47,901 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:47,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:47,903 INFO L85 PathProgramCache]: Analyzing trace with hash 614372559, now seen corresponding path program 1 times [2025-04-30 10:26:47,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:47,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512010896] [2025-04-30 10:26:47,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:47,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:47,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:26:47,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:26:47,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:47,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:48,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512010896] [2025-04-30 10:26:48,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512010896] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:48,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767859904] [2025-04-30 10:26:48,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:48,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:48,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:48,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:48,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:26:48,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-30 10:26:48,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-30 10:26:48,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:48,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:48,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:26:48,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:48,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767859904] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:48,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:48,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:26:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704542453] [2025-04-30 10:26:48,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:48,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:26:48,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:48,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:26:48,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:26:48,326 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-04-30 10:26:48,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 520 flow. Second operand has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 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-04-30 10:26:48,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:48,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-04-30 10:26:48,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:48,542 INFO L116 PetriNetUnfolderBase]: 41/506 cut-off events. [2025-04-30 10:26:48,543 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-30 10:26:48,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 506 events. 41/506 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2215 event pairs, 16 based on Foata normal form. 4/483 useless extension candidates. Maximal degree in co-relation 629. Up to 55 conditions per place. [2025-04-30 10:26:48,545 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 18 selfloop transitions, 21 changer transitions 0/206 dead transitions. [2025-04-30 10:26:48,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 686 flow [2025-04-30 10:26:48,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:26:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:26:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3130 transitions. [2025-04-30 10:26:48,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9144025708442887 [2025-04-30 10:26:48,555 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 520 flow. Second operand 21 states and 3130 transitions. [2025-04-30 10:26:48,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 686 flow [2025-04-30 10:26:48,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 206 transitions, 686 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:48,567 INFO L231 Difference]: Finished difference. Result has 207 places, 201 transitions, 650 flow [2025-04-30 10:26:48,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=650, PETRI_PLACES=207, PETRI_TRANSITIONS=201} [2025-04-30 10:26:48,568 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 44 predicate places. [2025-04-30 10:26:48,568 INFO L485 AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 650 flow [2025-04-30 10:26:48,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 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-04-30 10:26:48,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:48,570 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:26:48,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:26:48,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:26:48,771 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:48,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash 505936783, now seen corresponding path program 2 times [2025-04-30 10:26:48,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:48,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421800131] [2025-04-30 10:26:48,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:48,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:48,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-04-30 10:26:48,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-04-30 10:26:48,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:48,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-30 10:26:49,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:49,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421800131] [2025-04-30 10:26:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421800131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:49,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892529902] [2025-04-30 10:26:49,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:49,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:49,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:49,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:49,530 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 163 [2025-04-30 10:26:49,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 201 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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-04-30 10:26:49,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:49,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 163 [2025-04-30 10:26:49,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:49,722 INFO L116 PetriNetUnfolderBase]: 306/1340 cut-off events. [2025-04-30 10:26:49,722 INFO L117 PetriNetUnfolderBase]: For 283/293 co-relation queries the response was YES. [2025-04-30 10:26:49,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 1340 events. 306/1340 cut-off events. For 283/293 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9091 event pairs, 116 based on Foata normal form. 5/1232 useless extension candidates. Maximal degree in co-relation 2310. Up to 464 conditions per place. [2025-04-30 10:26:49,730 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 72 selfloop transitions, 36 changer transitions 2/258 dead transitions. [2025-04-30 10:26:49,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 258 transitions, 1022 flow [2025-04-30 10:26:49,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-04-30 10:26:49,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8936605316973415 [2025-04-30 10:26:49,733 INFO L175 Difference]: Start difference. First operand has 207 places, 201 transitions, 650 flow. Second operand 6 states and 874 transitions. [2025-04-30 10:26:49,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 258 transitions, 1022 flow [2025-04-30 10:26:49,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 258 transitions, 998 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:26:49,740 INFO L231 Difference]: Finished difference. Result has 210 places, 233 transitions, 878 flow [2025-04-30 10:26:49,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=878, PETRI_PLACES=210, PETRI_TRANSITIONS=233} [2025-04-30 10:26:49,740 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 47 predicate places. [2025-04-30 10:26:49,741 INFO L485 AbstractCegarLoop]: Abstraction has has 210 places, 233 transitions, 878 flow [2025-04-30 10:26:49,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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-04-30 10:26:49,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:49,741 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:26:49,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:49,742 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:49,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:49,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1719928748, now seen corresponding path program 1 times [2025-04-30 10:26:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:49,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908060958] [2025-04-30 10:26:49,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:49,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:49,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-30 10:26:49,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-30 10:26:49,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:49,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:49,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908060958] [2025-04-30 10:26:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908060958] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:26:49,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530358364] [2025-04-30 10:26:49,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:49,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:49,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:26:49,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:26:50,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-04-30 10:26:50,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-04-30 10:26:50,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:50,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:50,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:26:50,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:26:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:50,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:26:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530358364] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:26:50,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:26:50,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:26:50,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524029439] [2025-04-30 10:26:50,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:26:50,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:26:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:50,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:26:50,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:26:50,361 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-04-30 10:26:50,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 233 transitions, 878 flow. Second operand has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 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-04-30 10:26:50,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:50,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-04-30 10:26:50,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:50,712 INFO L116 PetriNetUnfolderBase]: 120/944 cut-off events. [2025-04-30 10:26:50,712 INFO L117 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2025-04-30 10:26:50,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 944 events. 120/944 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5985 event pairs, 33 based on Foata normal form. 3/888 useless extension candidates. Maximal degree in co-relation 1568. Up to 134 conditions per place. [2025-04-30 10:26:50,723 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 21 selfloop transitions, 30 changer transitions 0/250 dead transitions. [2025-04-30 10:26:50,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 250 transitions, 1102 flow [2025-04-30 10:26:50,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:26:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:26:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4464 transitions. [2025-04-30 10:26:50,734 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.912883435582822 [2025-04-30 10:26:50,734 INFO L175 Difference]: Start difference. First operand has 210 places, 233 transitions, 878 flow. Second operand 30 states and 4464 transitions. [2025-04-30 10:26:50,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 250 transitions, 1102 flow [2025-04-30 10:26:50,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 250 transitions, 1078 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:50,747 INFO L231 Difference]: Finished difference. Result has 242 places, 243 transitions, 1006 flow [2025-04-30 10:26:50,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1006, PETRI_PLACES=242, PETRI_TRANSITIONS=243} [2025-04-30 10:26:50,749 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 79 predicate places. [2025-04-30 10:26:50,749 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 243 transitions, 1006 flow [2025-04-30 10:26:50,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 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-04-30 10:26:50,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:50,753 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:26:50,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:26:50,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:26:50,954 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:50,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:50,955 INFO L85 PathProgramCache]: Analyzing trace with hash -351702443, now seen corresponding path program 2 times [2025-04-30 10:26:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:50,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443407408] [2025-04-30 10:26:50,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:50,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:50,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-04-30 10:26:50,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 157 statements. [2025-04-30 10:26:50,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:50,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:51,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:51,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443407408] [2025-04-30 10:26:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443407408] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:51,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:51,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:51,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215466418] [2025-04-30 10:26:51,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:51,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:51,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:51,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:51,583 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 163 [2025-04-30 10:26:51,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 243 transitions, 1006 flow. Second operand has 6 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 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-04-30 10:26:51,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:51,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 163 [2025-04-30 10:26:51,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:51,811 INFO L116 PetriNetUnfolderBase]: 306/1461 cut-off events. [2025-04-30 10:26:51,811 INFO L117 PetriNetUnfolderBase]: For 879/919 co-relation queries the response was YES. [2025-04-30 10:26:51,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1461 events. 306/1461 cut-off events. For 879/919 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10380 event pairs, 72 based on Foata normal form. 10/1424 useless extension candidates. Maximal degree in co-relation 3050. Up to 456 conditions per place. [2025-04-30 10:26:51,820 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 80 selfloop transitions, 49 changer transitions 0/309 dead transitions. [2025-04-30 10:26:51,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 309 transitions, 1563 flow [2025-04-30 10:26:51,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions. [2025-04-30 10:26:51,822 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9130879345603272 [2025-04-30 10:26:51,822 INFO L175 Difference]: Start difference. First operand has 242 places, 243 transitions, 1006 flow. Second operand 6 states and 893 transitions. [2025-04-30 10:26:51,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 309 transitions, 1563 flow [2025-04-30 10:26:51,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 309 transitions, 1517 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:26:51,833 INFO L231 Difference]: Finished difference. Result has 233 places, 284 transitions, 1376 flow [2025-04-30 10:26:51,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1376, PETRI_PLACES=233, PETRI_TRANSITIONS=284} [2025-04-30 10:26:51,835 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 70 predicate places. [2025-04-30 10:26:51,835 INFO L485 AbstractCegarLoop]: Abstraction has has 233 places, 284 transitions, 1376 flow [2025-04-30 10:26:51,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 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-04-30 10:26:51,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:51,836 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:26:51,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:26:51,836 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:51,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1459727782, now seen corresponding path program 1 times [2025-04-30 10:26:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:51,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471109795] [2025-04-30 10:26:51,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:51,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:26:51,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:26:51,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:51,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-30 10:26:52,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:52,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471109795] [2025-04-30 10:26:52,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471109795] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:52,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:52,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:52,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449281063] [2025-04-30 10:26:52,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:52,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:52,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:52,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:52,442 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2025-04-30 10:26:52,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 284 transitions, 1376 flow. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 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-04-30 10:26:52,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:52,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2025-04-30 10:26:52,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:52,866 INFO L116 PetriNetUnfolderBase]: 579/2228 cut-off events. [2025-04-30 10:26:52,866 INFO L117 PetriNetUnfolderBase]: For 2428/2488 co-relation queries the response was YES. [2025-04-30 10:26:52,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 2228 events. 579/2228 cut-off events. For 2428/2488 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17320 event pairs, 140 based on Foata normal form. 12/2155 useless extension candidates. Maximal degree in co-relation 5642. Up to 824 conditions per place. [2025-04-30 10:26:52,878 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 119 selfloop transitions, 78 changer transitions 11/378 dead transitions. [2025-04-30 10:26:52,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 378 transitions, 2316 flow [2025-04-30 10:26:52,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2025-04-30 10:26:52,881 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8987730061349694 [2025-04-30 10:26:52,881 INFO L175 Difference]: Start difference. First operand has 233 places, 284 transitions, 1376 flow. Second operand 6 states and 879 transitions. [2025-04-30 10:26:52,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 378 transitions, 2316 flow [2025-04-30 10:26:52,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 378 transitions, 2314 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:52,897 INFO L231 Difference]: Finished difference. Result has 242 places, 332 transitions, 1980 flow [2025-04-30 10:26:52,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1980, PETRI_PLACES=242, PETRI_TRANSITIONS=332} [2025-04-30 10:26:52,898 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 79 predicate places. [2025-04-30 10:26:52,898 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 332 transitions, 1980 flow [2025-04-30 10:26:52,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 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-04-30 10:26:52,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:52,898 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:26:52,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:26:52,899 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:52,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1170776066, now seen corresponding path program 1 times [2025-04-30 10:26:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:52,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610129481] [2025-04-30 10:26:52,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:52,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-30 10:26:52,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:26:52,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:52,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:52,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:26:52,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-30 10:26:52,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-30 10:26:52,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:52,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:52,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:26:52,997 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:26:52,997 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-04-30 10:26:52,999 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-30 10:26:53,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-30 10:26:53,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-30 10:26:53,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-30 10:26:53,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-30 10:26:53,000 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-30 10:26:53,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:26:53,000 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1] [2025-04-30 10:26:53,069 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:26:53,069 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:26:53,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:26:53 BasicIcfg [2025-04-30 10:26:53,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:26:53,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:26:53,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:26:53,075 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:26:53,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:45" (3/4) ... [2025-04-30 10:26:53,076 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:26:53,134 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 18. [2025-04-30 10:26:53,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:26:53,182 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:26:53,183 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:26:53,183 INFO L158 Benchmark]: Toolchain (without parser) took 9192.47ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 113.0MB in the beginning and 365.5MB in the end (delta: -252.5MB). Peak memory consumption was 87.2MB. Max. memory is 16.1GB. [2025-04-30 10:26:53,183 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:53,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.89ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 79.8MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:26:53,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.33ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 76.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:53,184 INFO L158 Benchmark]: Boogie Preprocessor took 30.86ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 75.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:53,185 INFO L158 Benchmark]: RCFGBuilder took 449.84ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 52.9MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:26:53,185 INFO L158 Benchmark]: TraceAbstraction took 8024.68ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 52.4MB in the beginning and 378.0MB in the end (delta: -325.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2025-04-30 10:26:53,185 INFO L158 Benchmark]: Witness Printer took 107.79ms. Allocated memory is still 486.5MB. Free memory was 378.0MB in the beginning and 365.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:26:53,186 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.46ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.89ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 79.8MB in the end (delta: 33.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.33ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 76.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.86ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 75.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 449.84ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 52.9MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8024.68ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 52.4MB in the beginning and 378.0MB in the end (delta: -325.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 107.79ms. Allocated memory is still 486.5MB. Free memory was 378.0MB in the beginning and 365.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 944]: Data race detected Data race detected The following path leads to a data race: [L922-L925] 0 struct s { int datum; pthread_mutex_t mutex; } a[10]; VAL [a={1:0}] [L937] 0 int i = 0; VAL [a={1:0}, i=0] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=1] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=2] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=3] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=4] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=5] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=6] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=7] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=8] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=9] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=10] [L937] COND FALSE 0 !(i < 10) VAL [a={1:0}] [L939] 0 int i = __VERIFIER_nondet_int(); VAL [a={1:0}, i=9] [L940] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, a={1:0}, cond=1] [L940] RET 0 assume_abort_if_not(0 <= i && i < 10) [L941] 0 pthread_t t1; VAL [a={1:0}, i=9] [L942] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [a={1:0}, i=9, t1=-1] [L927] 1 int i = __VERIFIER_nondet_int(); VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=8] [L928] CALL 1 assume_abort_if_not(0 <= i && i < 9) [L11] COND FALSE 1 !(!cond) VAL [\at(cond, Pre)=1, a={1:0}, cond=1] [L928] RET 1 assume_abort_if_not(0 <= i && i < 9) [L929] 1 struct s *p = &a[i]; VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=8, p={1:224}] [L931] 1 i++ VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L944] EXPR 0 a[i].datum VAL [a={1:0}, i=9, t1=-1] [L944] 0 a[i].datum++ VAL [a={1:0}, i=9, t1=-1] [L932] EXPR 1 a[i].datum VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L932] 1 a[i].datum++ VAL [\at(arg, Pre)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L944] 0 a[i].datum++ VAL [a={1:0}, i=9, t1=-1] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: a[i].datum++ [944] * C: a[i].datum++ [932] * C: a[i].datum++ [944] * C: a[i].datum++ [944] * C: a[i].datum++ [944] and C: a[i].datum++ [944] - UnprovableResult [Line: 944]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 942]: Unable to prove that 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: 932]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 932]: 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, 204 locations, 206 edges, 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: 7.8s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1756 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1322 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3057 IncrementalHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 109 mSDtfsCounter, 3057 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 695 SyntacticMatches, 11 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1980occurred in iteration=8, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1722 ConstructedInterpolants, 0 QuantifiedInterpolants, 2532 SizeOfPredicates, 22 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 600/993 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-04-30 10:26:53,199 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)