./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/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-?-735b3cc-m [2025-03-14 01:35:29,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:35:29,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:35:29,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:35:29,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:35:29,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:35:29,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:35:29,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:35:29,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:35:29,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:35:29,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:35:29,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:35:29,807 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:35:29,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:35:29,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:35:29,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:35:29,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:29,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:35:29,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:35:29,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:35:29,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:35:29,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:35:29,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:35:29,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:35:29,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:35:29,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:35:29,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:35:29,809 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-03-14 01:35:30,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:35:30,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:35:30,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:35:30,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:35:30,039 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:35:30,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i [2025-03-14 01:35:31,198 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae0db346/69630e39a01d42d0a99ee00fc059b132/FLAGcfc6d2208 [2025-03-14 01:35:31,453 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:35:31,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i [2025-03-14 01:35:31,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae0db346/69630e39a01d42d0a99ee00fc059b132/FLAGcfc6d2208 [2025-03-14 01:35:31,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae0db346/69630e39a01d42d0a99ee00fc059b132 [2025-03-14 01:35:31,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:35:31,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:35:31,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:31,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:35:31,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:35:31,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:31" (1/1) ... [2025-03-14 01:35:31,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb1028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:31, skipping insertion in model container [2025-03-14 01:35:31,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:31" (1/1) ... [2025-03-14 01:35:31,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:35:32,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:32,073 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:35:32,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:32,162 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:35:32,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32 WrapperNode [2025-03-14 01:35:32,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:32,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:32,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:35:32,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:35:32,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,197 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2025-03-14 01:35:32,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:32,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:35:32,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:35:32,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:35:32,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,214 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:35:32,218 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:35:32,218 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:35:32,219 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:35:32,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (1/1) ... [2025-03-14 01:35:32,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:32,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:35:32,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:35:32,274 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:35:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:35:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:35:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:35:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:35:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:35:32,275 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:35:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:35:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:35:32,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:35:32,276 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:35:32,374 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:35:32,375 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:35:32,637 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:35:32,638 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:35:32,638 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:35:32,655 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:35:32,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:32 BoogieIcfgContainer [2025-03-14 01:35:32,655 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:35:32,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:35:32,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:35:32,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:35:32,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:35:31" (1/3) ... [2025-03-14 01:35:32,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1538ca3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:32, skipping insertion in model container [2025-03-14 01:35:32,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:32" (2/3) ... [2025-03-14 01:35:32,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1538ca3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:32, skipping insertion in model container [2025-03-14 01:35:32,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:32" (3/3) ... [2025-03-14 01:35:32,662 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_09-tricky_address4.i [2025-03-14 01:35:32,672 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:35:32,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_09-tricky_address4.i that has 2 procedures, 161 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-14 01:35:32,674 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:35:32,736 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:35:32,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 163 transitions, 330 flow [2025-03-14 01:35:32,833 INFO L124 PetriNetUnfolderBase]: 3/162 cut-off events. [2025-03-14 01:35:32,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:32,839 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 3. Compared 83 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-03-14 01:35:32,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 163 transitions, 330 flow [2025-03-14 01:35:32,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 162 transitions, 327 flow [2025-03-14 01:35:32,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:35:32,862 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@16f2d2f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:35:32,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 01:35:32,877 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:35:32,877 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-03-14 01:35:32,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:32,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:32,880 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-03-14 01:35:32,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:32,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:32,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1906204390, now seen corresponding path program 1 times [2025-03-14 01:35:32,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:32,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017321033] [2025-03-14 01:35:32,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:32,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:32,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-14 01:35:33,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-14 01:35:33,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:33,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:33,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017321033] [2025-03-14 01:35:33,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017321033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:33,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:33,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:35:33,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523562448] [2025-03-14 01:35:33,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:33,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:35:33,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:33,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:35:33,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:35:33,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 163 [2025-03-14 01:35:33,278 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-03-14 01:35:33,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:33,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 163 [2025-03-14 01:35:33,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:33,334 INFO L124 PetriNetUnfolderBase]: 7/224 cut-off events. [2025-03-14 01:35:33,335 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:33,336 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 337 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-03-14 01:35:33,337 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 10 selfloop transitions, 2 changer transitions 1/161 dead transitions. [2025-03-14 01:35:33,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 349 flow [2025-03-14 01:35:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:35:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:35:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-03-14 01:35:33,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950920245398773 [2025-03-14 01:35:33,358 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 327 flow. Second operand 3 states and 465 transitions. [2025-03-14 01:35:33,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 349 flow [2025-03-14 01:35:33,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:33,365 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 332 flow [2025-03-14 01:35:33,367 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-03-14 01:35:33,369 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 2 predicate places. [2025-03-14 01:35:33,370 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 332 flow [2025-03-14 01:35:33,370 INFO L472 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-03-14 01:35:33,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:33,370 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-03-14 01:35:33,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:35:33,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:33,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:33,372 INFO L85 PathProgramCache]: Analyzing trace with hash 607800763, now seen corresponding path program 1 times [2025-03-14 01:35:33,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:33,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214463815] [2025-03-14 01:35:33,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:33,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:33,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-14 01:35:33,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-14 01:35:33,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:33,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:33,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214463815] [2025-03-14 01:35:33,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214463815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:33,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609710415] [2025-03-14 01:35:33,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:33,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:33,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:33,597 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-03-14 01:35:33,598 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-03-14 01:35:33,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-14 01:35:33,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-14 01:35:33,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:33,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:33,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:35:33,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:33,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:35:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:33,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609710415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:35:33,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:35:33,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:35:33,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591516695] [2025-03-14 01:35:33,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:35:33,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:35:33,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:33,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:35:33,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:35:33,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-03-14 01:35:33,825 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-03-14 01:35:33,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:33,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-03-14 01:35:33,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:33,919 INFO L124 PetriNetUnfolderBase]: 7/230 cut-off events. [2025-03-14 01:35:33,921 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:35:33,922 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 330 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-03-14 01:35:33,923 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 14 selfloop transitions, 9 changer transitions 0/168 dead transitions. [2025-03-14 01:35:33,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 396 flow [2025-03-14 01:35:33,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:35:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:35:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2025-03-14 01:35:33,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9188820722563054 [2025-03-14 01:35:33,932 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 332 flow. Second operand 9 states and 1348 transitions. [2025-03-14 01:35:33,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 396 flow [2025-03-14 01:35:33,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:33,936 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 380 flow [2025-03-14 01:35:33,937 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-03-14 01:35:33,939 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 11 predicate places. [2025-03-14 01:35:33,939 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 380 flow [2025-03-14 01:35:33,940 INFO L472 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-03-14 01:35:33,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:33,941 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-03-14 01:35:33,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:35:34,143 WARN L453 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-03-14 01:35:34,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:34,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1420723355, now seen corresponding path program 2 times [2025-03-14 01:35:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:34,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020362504] [2025-03-14 01:35:34,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:34,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-14 01:35:34,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-03-14 01:35:34,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:35:34,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-14 01:35:34,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:34,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020362504] [2025-03-14 01:35:34,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020362504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:34,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587807538] [2025-03-14 01:35:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:34,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:34,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:34,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:34,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:35,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 163 [2025-03-14 01:35:35,145 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-03-14 01:35:35,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:35,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 163 [2025-03-14 01:35:35,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:35,311 INFO L124 PetriNetUnfolderBase]: 129/671 cut-off events. [2025-03-14 01:35:35,311 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:35:35,314 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 3504 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-03-14 01:35:35,317 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 43 selfloop transitions, 22 changer transitions 0/207 dead transitions. [2025-03-14 01:35:35,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 207 transitions, 592 flow [2025-03-14 01:35:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 888 transitions. [2025-03-14 01:35:35,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079754601226994 [2025-03-14 01:35:35,322 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 380 flow. Second operand 6 states and 888 transitions. [2025-03-14 01:35:35,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 207 transitions, 592 flow [2025-03-14 01:35:35,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 207 transitions, 586 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:35:35,328 INFO L231 Difference]: Finished difference. Result has 182 places, 188 transitions, 520 flow [2025-03-14 01:35:35,329 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-03-14 01:35:35,330 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 19 predicate places. [2025-03-14 01:35:35,330 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 188 transitions, 520 flow [2025-03-14 01:35:35,331 INFO L472 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-03-14 01:35:35,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:35,331 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-03-14 01:35:35,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:35:35,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:35,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash 654774359, now seen corresponding path program 1 times [2025-03-14 01:35:35,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:35,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712935604] [2025-03-14 01:35:35,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:35,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:35,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-14 01:35:35,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-14 01:35:35,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:35,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:35,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:35,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712935604] [2025-03-14 01:35:35,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712935604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:35,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520736487] [2025-03-14 01:35:35,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:35,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:35,526 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-03-14 01:35:35,528 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-03-14 01:35:35,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-14 01:35:35,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-14 01:35:35,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:35,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:35,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:35:35,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:35,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:35:35,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:35,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520736487] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:35:35,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:35:35,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:35:35,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421236995] [2025-03-14 01:35:35,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:35:35,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:35:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:35,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:35:35,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:35:35,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-03-14 01:35:35,770 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-03-14 01:35:35,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:35,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-03-14 01:35:35,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:35,998 INFO L124 PetriNetUnfolderBase]: 41/506 cut-off events. [2025-03-14 01:35:35,998 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-14 01:35:35,999 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 2211 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-03-14 01:35:36,000 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 18 selfloop transitions, 21 changer transitions 0/206 dead transitions. [2025-03-14 01:35:36,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 686 flow [2025-03-14 01:35:36,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:35:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:35:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3130 transitions. [2025-03-14 01:35:36,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9144025708442887 [2025-03-14 01:35:36,006 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 520 flow. Second operand 21 states and 3130 transitions. [2025-03-14 01:35:36,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 686 flow [2025-03-14 01:35:36,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 206 transitions, 686 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:36,012 INFO L231 Difference]: Finished difference. Result has 207 places, 201 transitions, 650 flow [2025-03-14 01:35:36,012 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-03-14 01:35:36,013 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 44 predicate places. [2025-03-14 01:35:36,013 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 650 flow [2025-03-14 01:35:36,014 INFO L472 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-03-14 01:35:36,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:36,014 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-03-14 01:35:36,021 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-03-14 01:35:36,215 WARN L453 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-03-14 01:35:36,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:36,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1119778327, now seen corresponding path program 2 times [2025-03-14 01:35:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574639428] [2025-03-14 01:35:36,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:36,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-14 01:35:36,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-03-14 01:35:36,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:35:36,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-14 01:35:36,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:36,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574639428] [2025-03-14 01:35:36,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574639428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:36,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:36,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:36,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106633530] [2025-03-14 01:35:36,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:36,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:36,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:36,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:36,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 163 [2025-03-14 01:35:36,935 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-03-14 01:35:36,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:36,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 163 [2025-03-14 01:35:36,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:37,143 INFO L124 PetriNetUnfolderBase]: 306/1340 cut-off events. [2025-03-14 01:35:37,144 INFO L125 PetriNetUnfolderBase]: For 280/290 co-relation queries the response was YES. [2025-03-14 01:35:37,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 1340 events. 306/1340 cut-off events. For 280/290 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9099 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-03-14 01:35:37,153 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 72 selfloop transitions, 36 changer transitions 2/258 dead transitions. [2025-03-14 01:35:37,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 258 transitions, 1022 flow [2025-03-14 01:35:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:37,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-03-14 01:35:37,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8936605316973415 [2025-03-14 01:35:37,155 INFO L175 Difference]: Start difference. First operand has 207 places, 201 transitions, 650 flow. Second operand 6 states and 874 transitions. [2025-03-14 01:35:37,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 258 transitions, 1022 flow [2025-03-14 01:35:37,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 258 transitions, 998 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-14 01:35:37,162 INFO L231 Difference]: Finished difference. Result has 210 places, 233 transitions, 878 flow [2025-03-14 01:35:37,163 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-03-14 01:35:37,163 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 47 predicate places. [2025-03-14 01:35:37,163 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 233 transitions, 878 flow [2025-03-14 01:35:37,164 INFO L472 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-03-14 01:35:37,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:37,164 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-03-14 01:35:37,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:35:37,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:37,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash -381295410, now seen corresponding path program 1 times [2025-03-14 01:35:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:37,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305224472] [2025-03-14 01:35:37,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:37,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-14 01:35:37,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-14 01:35:37,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:37,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:37,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305224472] [2025-03-14 01:35:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305224472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:35:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044417849] [2025-03-14 01:35:37,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:35:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:37,456 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-03-14 01:35:37,459 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-03-14 01:35:37,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-14 01:35:37,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-14 01:35:37,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:37,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:37,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:35:37,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:35:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:37,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:35:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:35:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044417849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:35:37,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:35:37,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-14 01:35:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388467944] [2025-03-14 01:35:37,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:35:37,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:35:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:37,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:35:37,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:35:37,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-03-14 01:35:37,819 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-03-14 01:35:37,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:37,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-03-14 01:35:37,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:38,196 INFO L124 PetriNetUnfolderBase]: 120/944 cut-off events. [2025-03-14 01:35:38,196 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2025-03-14 01:35:38,201 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 5981 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-03-14 01:35:38,204 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 21 selfloop transitions, 30 changer transitions 0/250 dead transitions. [2025-03-14 01:35:38,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 250 transitions, 1102 flow [2025-03-14 01:35:38,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:35:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:35:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4464 transitions. [2025-03-14 01:35:38,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912883435582822 [2025-03-14 01:35:38,211 INFO L175 Difference]: Start difference. First operand has 210 places, 233 transitions, 878 flow. Second operand 30 states and 4464 transitions. [2025-03-14 01:35:38,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 250 transitions, 1102 flow [2025-03-14 01:35:38,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 250 transitions, 1078 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:38,220 INFO L231 Difference]: Finished difference. Result has 242 places, 243 transitions, 1006 flow [2025-03-14 01:35:38,220 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-03-14 01:35:38,221 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 79 predicate places. [2025-03-14 01:35:38,221 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 243 transitions, 1006 flow [2025-03-14 01:35:38,222 INFO L472 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-03-14 01:35:38,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:38,223 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-03-14 01:35:38,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:35:38,424 WARN L453 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-03-14 01:35:38,424 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:38,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash -69079933, now seen corresponding path program 2 times [2025-03-14 01:35:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38326197] [2025-03-14 01:35:38,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:35:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:38,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-03-14 01:35:38,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 157 statements. [2025-03-14 01:35:38,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:35:38,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-14 01:35:38,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:38,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38326197] [2025-03-14 01:35:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38326197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:38,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636347903] [2025-03-14 01:35:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:38,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:38,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:38,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:39,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 163 [2025-03-14 01:35:39,055 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-03-14 01:35:39,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:39,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 163 [2025-03-14 01:35:39,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:39,285 INFO L124 PetriNetUnfolderBase]: 306/1461 cut-off events. [2025-03-14 01:35:39,285 INFO L125 PetriNetUnfolderBase]: For 883/923 co-relation queries the response was YES. [2025-03-14 01:35:39,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1461 events. 306/1461 cut-off events. For 883/923 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10346 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-03-14 01:35:39,292 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 80 selfloop transitions, 49 changer transitions 0/309 dead transitions. [2025-03-14 01:35:39,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 309 transitions, 1563 flow [2025-03-14 01:35:39,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions. [2025-03-14 01:35:39,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130879345603272 [2025-03-14 01:35:39,295 INFO L175 Difference]: Start difference. First operand has 242 places, 243 transitions, 1006 flow. Second operand 6 states and 893 transitions. [2025-03-14 01:35:39,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 309 transitions, 1563 flow [2025-03-14 01:35:39,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 309 transitions, 1517 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-14 01:35:39,304 INFO L231 Difference]: Finished difference. Result has 233 places, 284 transitions, 1376 flow [2025-03-14 01:35:39,304 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-03-14 01:35:39,306 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 70 predicate places. [2025-03-14 01:35:39,306 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 284 transitions, 1376 flow [2025-03-14 01:35:39,306 INFO L472 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-03-14 01:35:39,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:39,307 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-03-14 01:35:39,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:35:39,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:39,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1836272135, now seen corresponding path program 1 times [2025-03-14 01:35:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:39,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902723535] [2025-03-14 01:35:39,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:39,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:39,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-14 01:35:39,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-14 01:35:39,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:39,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-14 01:35:39,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902723535] [2025-03-14 01:35:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902723535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:39,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:39,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:39,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16741516] [2025-03-14 01:35:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:39,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:39,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:39,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:39,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:39,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2025-03-14 01:35:39,998 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-03-14 01:35:39,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:39,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2025-03-14 01:35:39,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:35:40,356 INFO L124 PetriNetUnfolderBase]: 579/2228 cut-off events. [2025-03-14 01:35:40,356 INFO L125 PetriNetUnfolderBase]: For 2429/2489 co-relation queries the response was YES. [2025-03-14 01:35:40,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 2228 events. 579/2228 cut-off events. For 2429/2489 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17326 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-03-14 01:35:40,366 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 119 selfloop transitions, 78 changer transitions 11/378 dead transitions. [2025-03-14 01:35:40,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 378 transitions, 2316 flow [2025-03-14 01:35:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:35:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:35:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2025-03-14 01:35:40,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8987730061349694 [2025-03-14 01:35:40,368 INFO L175 Difference]: Start difference. First operand has 233 places, 284 transitions, 1376 flow. Second operand 6 states and 879 transitions. [2025-03-14 01:35:40,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 378 transitions, 2316 flow [2025-03-14 01:35:40,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 378 transitions, 2314 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:35:40,383 INFO L231 Difference]: Finished difference. Result has 242 places, 332 transitions, 1980 flow [2025-03-14 01:35:40,384 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-03-14 01:35:40,385 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 79 predicate places. [2025-03-14 01:35:40,385 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 332 transitions, 1980 flow [2025-03-14 01:35:40,385 INFO L472 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-03-14 01:35:40,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:40,386 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-03-14 01:35:40,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:35:40,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 01:35:40,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 576807169, now seen corresponding path program 1 times [2025-03-14 01:35:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869360553] [2025-03-14 01:35:40,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:40,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-14 01:35:40,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-14 01:35:40,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:40,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:35:40,422 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:35:40,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-14 01:35:40,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-14 01:35:40,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:40,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:35:40,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:35:40,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:35:40,488 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-14 01:35:40,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-14 01:35:40,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-14 01:35:40,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-14 01:35:40,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-14 01:35:40,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-14 01:35:40,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-14 01:35:40,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:35:40,491 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1] [2025-03-14 01:35:40,536 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:35:40,536 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:35:40,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:35:40 BasicIcfg [2025-03-14 01:35:40,542 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:35:40,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:35:40,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:35:40,543 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:35:40,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:32" (3/4) ... [2025-03-14 01:35:40,544 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-14 01:35:40,589 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 18. [2025-03-14 01:35:40,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:35:40,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:35:40,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:35:40,635 INFO L158 Benchmark]: Toolchain (without parser) took 8857.81ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 112.3MB in the beginning and 153.2MB in the end (delta: -40.9MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2025-03-14 01:35:40,635 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:40,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.70ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 82.3MB in the end (delta: 30.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 01:35:40,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.73ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 79.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:40,636 INFO L158 Benchmark]: Boogie Preprocessor took 20.58ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 78.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:35:40,637 INFO L158 Benchmark]: IcfgBuilder took 437.01ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 55.8MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:35:40,637 INFO L158 Benchmark]: TraceAbstraction took 7885.20ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 54.8MB in the beginning and 164.6MB in the end (delta: -109.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2025-03-14 01:35:40,637 INFO L158 Benchmark]: Witness Printer took 91.69ms. Allocated memory is still 268.4MB. Free memory was 164.6MB in the beginning and 153.2MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:35:40,638 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.70ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 82.3MB in the end (delta: 30.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.73ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 79.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.58ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 78.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 437.01ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 55.8MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7885.20ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 54.8MB in the beginning and 164.6MB in the end (delta: -109.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Witness Printer took 91.69ms. Allocated memory is still 268.4MB. Free memory was 164.6MB in the beginning and 153.2MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. 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 [\old(cond)=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 [\old(arg)={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 [\old(cond)=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 [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=8, p={1:224}] [L931] 1 i++ VAL [\old(arg)={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 [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L932] 1 a[i].datum++ VAL [\old(arg)={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++ [932] * C: a[i].datum++ [944] * 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, 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.7s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, 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-03-14 01:35:40,655 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)