./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-1_3-join.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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/ldv-races/race-1_3-join.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 8c7f2059024755e8d2127555397365a96bb56530f6a4795548fd916204307c42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:52:13,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:52:13,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:52:13,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:52:13,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:52:13,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:52:13,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:52:13,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:52:13,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:52:13,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:52:13,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:52:13,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:52:13,504 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:52:13,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:52:13,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:52:13,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:52:13,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:52:13,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:52:13,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:52:13,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:52:13,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:52:13,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:52:13,505 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:52:13,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:52:13,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:52:13,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:52:13,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:52:13,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:52:13,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:52:13,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:52:13,506 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 -> 8c7f2059024755e8d2127555397365a96bb56530f6a4795548fd916204307c42 [2025-03-08 21:52:13,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:52:13,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:52:13,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:52:13,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:52:13,761 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:52:13,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-1_3-join.i [2025-03-08 21:52:14,925 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25f3d8b2/06da993b8d0d44aa814a6f6941859e3d/FLAG5e45099dd [2025-03-08 21:52:15,239 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:52:15,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_3-join.i [2025-03-08 21:52:15,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25f3d8b2/06da993b8d0d44aa814a6f6941859e3d/FLAG5e45099dd [2025-03-08 21:52:15,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e25f3d8b2/06da993b8d0d44aa814a6f6941859e3d [2025-03-08 21:52:15,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:52:15,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:52:15,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:52:15,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:52:15,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:52:15,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:52:15" (1/1) ... [2025-03-08 21:52:15,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b090229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:15, skipping insertion in model container [2025-03-08 21:52:15,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:52:15" (1/1) ... [2025-03-08 21:52:15,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:52:16,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:52:16,072 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:52:16,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:52:16,212 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:52:16,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16 WrapperNode [2025-03-08 21:52:16,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:52:16,215 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:52:16,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:52:16,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:52:16,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,264 INFO L138 Inliner]: procedures = 483, calls = 31, calls flagged for inlining = 9, calls inlined = 12, statements flattened = 123 [2025-03-08 21:52:16,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:52:16,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:52:16,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:52:16,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:52:16,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:52:16,295 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:52:16,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:52:16,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:52:16,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (1/1) ... [2025-03-08 21:52:16,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:52:16,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:52:16,328 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-08 21:52:16,330 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-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:52:16,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 21:52:16,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 21:52:16,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:52:16,352 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:52:16,572 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:52:16,574 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:52:16,726 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:52:16,726 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:52:16,767 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:52:16,767 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:52:16,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:52:16 BoogieIcfgContainer [2025-03-08 21:52:16,768 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:52:16,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:52:16,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:52:16,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:52:16,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:52:15" (1/3) ... [2025-03-08 21:52:16,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370f061b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:52:16, skipping insertion in model container [2025-03-08 21:52:16,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:16" (2/3) ... [2025-03-08 21:52:16,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370f061b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:52:16, skipping insertion in model container [2025-03-08 21:52:16,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:52:16" (3/3) ... [2025-03-08 21:52:16,775 INFO L128 eAbstractionObserver]: Analyzing ICFG race-1_3-join.i [2025-03-08 21:52:16,785 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:52:16,786 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-1_3-join.i that has 2 procedures, 134 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-03-08 21:52:16,786 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:52:16,824 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 21:52:16,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 141 transitions, 289 flow [2025-03-08 21:52:16,914 INFO L124 PetriNetUnfolderBase]: 7/160 cut-off events. [2025-03-08 21:52:16,915 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:52:16,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 160 events. 7/160 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 98. Up to 3 conditions per place. [2025-03-08 21:52:16,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 141 transitions, 289 flow [2025-03-08 21:52:16,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 123 transitions, 252 flow [2025-03-08 21:52:16,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:52:16,939 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;@5af5ed4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:52:16,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-08 21:52:16,948 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:52:16,948 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 21:52:16,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:52:16,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:16,949 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] [2025-03-08 21:52:16,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:52:16,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash -488681372, now seen corresponding path program 1 times [2025-03-08 21:52:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:16,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469903605] [2025-03-08 21:52:16,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:16,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:17,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 21:52:17,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 21:52:17,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:17,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:17,233 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-08 21:52:17,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:17,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469903605] [2025-03-08 21:52:17,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469903605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:17,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:17,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:17,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766727596] [2025-03-08 21:52:17,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:17,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:17,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:17,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:17,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:17,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2025-03-08 21:52:17,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-08 21:52:17,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:17,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2025-03-08 21:52:17,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:17,373 INFO L124 PetriNetUnfolderBase]: 9/164 cut-off events. [2025-03-08 21:52:17,373 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:52:17,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 164 events. 9/164 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 385 event pairs, 9 based on Foata normal form. 4/147 useless extension candidates. Maximal degree in co-relation 89. Up to 38 conditions per place. [2025-03-08 21:52:17,377 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 16 selfloop transitions, 2 changer transitions 12/111 dead transitions. [2025-03-08 21:52:17,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 264 flow [2025-03-08 21:52:17,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-08 21:52:17,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416075650118203 [2025-03-08 21:52:17,391 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 252 flow. Second operand 3 states and 356 transitions. [2025-03-08 21:52:17,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 264 flow [2025-03-08 21:52:17,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:17,400 INFO L231 Difference]: Finished difference. Result has 114 places, 99 transitions, 204 flow [2025-03-08 21:52:17,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=114, PETRI_TRANSITIONS=99} [2025-03-08 21:52:17,406 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -8 predicate places. [2025-03-08 21:52:17,406 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 99 transitions, 204 flow [2025-03-08 21:52:17,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-08 21:52:17,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:17,407 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] [2025-03-08 21:52:17,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:52:17,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:52:17,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1632694298, now seen corresponding path program 1 times [2025-03-08 21:52:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:17,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755248632] [2025-03-08 21:52:17,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:17,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 21:52:17,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 21:52:17,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:17,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:17,505 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-08 21:52:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755248632] [2025-03-08 21:52:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755248632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:17,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:17,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:17,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136957975] [2025-03-08 21:52:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:17,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:17,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:17,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:17,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:17,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2025-03-08 21:52:17,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 99 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:52:17,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:17,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2025-03-08 21:52:17,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:17,566 INFO L124 PetriNetUnfolderBase]: 6/140 cut-off events. [2025-03-08 21:52:17,566 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 21:52:17,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 140 events. 6/140 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 234 event pairs, 2 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 147. Up to 18 conditions per place. [2025-03-08 21:52:17,567 INFO L140 encePairwiseOnDemand]: 130/141 looper letters, 13 selfloop transitions, 7 changer transitions 3/102 dead transitions. [2025-03-08 21:52:17,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 102 transitions, 253 flow [2025-03-08 21:52:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2025-03-08 21:52:17,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8368794326241135 [2025-03-08 21:52:17,569 INFO L175 Difference]: Start difference. First operand has 114 places, 99 transitions, 204 flow. Second operand 3 states and 354 transitions. [2025-03-08 21:52:17,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 102 transitions, 253 flow [2025-03-08 21:52:17,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 102 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:17,571 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 221 flow [2025-03-08 21:52:17,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2025-03-08 21:52:17,572 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -22 predicate places. [2025-03-08 21:52:17,572 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 221 flow [2025-03-08 21:52:17,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:52:17,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:17,573 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] [2025-03-08 21:52:17,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:52:17,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:52:17,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash 134943401, now seen corresponding path program 1 times [2025-03-08 21:52:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:17,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399241662] [2025-03-08 21:52:17,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:17,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:17,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 21:52:17,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 21:52:17,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:17,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:17,642 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-08 21:52:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399241662] [2025-03-08 21:52:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399241662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:17,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933364787] [2025-03-08 21:52:17,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:17,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:17,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:17,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:17,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2025-03-08 21:52:17,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-08 21:52:17,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:17,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2025-03-08 21:52:17,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:17,707 INFO L124 PetriNetUnfolderBase]: 9/149 cut-off events. [2025-03-08 21:52:17,707 INFO L125 PetriNetUnfolderBase]: For 22/26 co-relation queries the response was YES. [2025-03-08 21:52:17,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 149 events. 9/149 cut-off events. For 22/26 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 317 event pairs, 7 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 47. Up to 40 conditions per place. [2025-03-08 21:52:17,708 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 18 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2025-03-08 21:52:17,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 95 transitions, 259 flow [2025-03-08 21:52:17,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2025-03-08 21:52:17,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8226950354609929 [2025-03-08 21:52:17,709 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 221 flow. Second operand 3 states and 348 transitions. [2025-03-08 21:52:17,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 95 transitions, 259 flow [2025-03-08 21:52:17,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:52:17,712 INFO L231 Difference]: Finished difference. Result has 97 places, 95 transitions, 216 flow [2025-03-08 21:52:17,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=97, PETRI_TRANSITIONS=95} [2025-03-08 21:52:17,713 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -25 predicate places. [2025-03-08 21:52:17,713 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 216 flow [2025-03-08 21:52:17,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-08 21:52:17,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:17,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:52:17,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:52:17,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:52:17,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1248063023, now seen corresponding path program 1 times [2025-03-08 21:52:17,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:17,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994965100] [2025-03-08 21:52:17,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:17,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 21:52:17,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 21:52:17,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:17,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:17,790 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-08 21:52:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994965100] [2025-03-08 21:52:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994965100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:17,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:17,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:17,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893610671] [2025-03-08 21:52:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:17,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:17,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:17,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:17,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 141 [2025-03-08 21:52:17,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-08 21:52:17,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:17,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 141 [2025-03-08 21:52:17,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:17,838 INFO L124 PetriNetUnfolderBase]: 16/180 cut-off events. [2025-03-08 21:52:17,838 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-08 21:52:17,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 180 events. 16/180 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 455 event pairs, 2 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 223. Up to 48 conditions per place. [2025-03-08 21:52:17,840 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 17 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2025-03-08 21:52:17,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 97 transitions, 260 flow [2025-03-08 21:52:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2025-03-08 21:52:17,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.851063829787234 [2025-03-08 21:52:17,843 INFO L175 Difference]: Start difference. First operand has 97 places, 95 transitions, 216 flow. Second operand 3 states and 360 transitions. [2025-03-08 21:52:17,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 97 transitions, 260 flow [2025-03-08 21:52:17,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:17,846 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 214 flow [2025-03-08 21:52:17,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2025-03-08 21:52:17,846 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -26 predicate places. [2025-03-08 21:52:17,847 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 214 flow [2025-03-08 21:52:17,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-08 21:52:17,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:17,847 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] [2025-03-08 21:52:17,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:52:17,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:52:17,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1841393570, now seen corresponding path program 1 times [2025-03-08 21:52:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:17,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083190315] [2025-03-08 21:52:17,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:17,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 21:52:17,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 21:52:17,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:17,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:17,922 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-08 21:52:17,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083190315] [2025-03-08 21:52:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083190315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:17,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141748858] [2025-03-08 21:52:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:17,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:17,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:17,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:17,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:17,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 141 [2025-03-08 21:52:17,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-08 21:52:17,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:17,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 141 [2025-03-08 21:52:17,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:17,966 INFO L124 PetriNetUnfolderBase]: 14/145 cut-off events. [2025-03-08 21:52:17,967 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2025-03-08 21:52:17,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 145 events. 14/145 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 270 event pairs, 4 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 127. Up to 24 conditions per place. [2025-03-08 21:52:17,968 INFO L140 encePairwiseOnDemand]: 139/141 looper letters, 14 selfloop transitions, 1 changer transitions 16/96 dead transitions. [2025-03-08 21:52:17,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 250 flow [2025-03-08 21:52:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-08 21:52:17,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8699763593380615 [2025-03-08 21:52:17,970 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 214 flow. Second operand 3 states and 368 transitions. [2025-03-08 21:52:17,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 250 flow [2025-03-08 21:52:17,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 96 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:17,973 INFO L231 Difference]: Finished difference. Result has 95 places, 77 transitions, 174 flow [2025-03-08 21:52:17,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2025-03-08 21:52:17,975 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -27 predicate places. [2025-03-08 21:52:17,975 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 174 flow [2025-03-08 21:52:17,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-08 21:52:17,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:17,976 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] [2025-03-08 21:52:17,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:52:17,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:52:17,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash -164454108, now seen corresponding path program 1 times [2025-03-08 21:52:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:17,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505854025] [2025-03-08 21:52:17,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:18,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 21:52:18,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 21:52:18,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:18,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:18,092 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-08 21:52:18,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:18,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505854025] [2025-03-08 21:52:18,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505854025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:18,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:18,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:18,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082390482] [2025-03-08 21:52:18,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:18,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:18,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:18,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:18,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:18,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 141 [2025-03-08 21:52:18,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-08 21:52:18,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:18,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 141 [2025-03-08 21:52:18,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:18,146 INFO L124 PetriNetUnfolderBase]: 9/112 cut-off events. [2025-03-08 21:52:18,146 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 21:52:18,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 112 events. 9/112 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 147 event pairs, 7 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 134. Up to 33 conditions per place. [2025-03-08 21:52:18,147 INFO L140 encePairwiseOnDemand]: 139/141 looper letters, 0 selfloop transitions, 0 changer transitions 76/76 dead transitions. [2025-03-08 21:52:18,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 202 flow [2025-03-08 21:52:18,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2025-03-08 21:52:18,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8108747044917257 [2025-03-08 21:52:18,149 INFO L175 Difference]: Start difference. First operand has 95 places, 77 transitions, 174 flow. Second operand 3 states and 343 transitions. [2025-03-08 21:52:18,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 202 flow [2025-03-08 21:52:18,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:52:18,150 INFO L231 Difference]: Finished difference. Result has 80 places, 0 transitions, 0 flow [2025-03-08 21:52:18,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=80, PETRI_TRANSITIONS=0} [2025-03-08 21:52:18,151 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -42 predicate places. [2025-03-08 21:52:18,151 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 0 transitions, 0 flow [2025-03-08 21:52:18,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-08 21:52:18,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-03-08 21:52:18,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-08 21:52:18,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-08 21:52:18,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-08 21:52:18,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-08 21:52:18,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-08 21:52:18,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-08 21:52:18,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-08 21:52:18,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-08 21:52:18,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-08 21:52:18,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-08 21:52:18,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2025-03-08 21:52:18,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-08 21:52:18,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:52:18,159 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 21:52:18,163 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:52:18,163 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:52:18,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:52:18 BasicIcfg [2025-03-08 21:52:18,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:52:18,169 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:52:18,169 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:52:18,169 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:52:18,176 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:52:16" (3/4) ... [2025-03-08 21:52:18,178 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 21:52:18,180 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 21:52:18,185 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 21:52:18,185 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 21:52:18,185 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:52:18,185 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 21:52:18,243 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:52:18,243 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:52:18,244 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:52:18,244 INFO L158 Benchmark]: Toolchain (without parser) took 2725.33ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 97.1MB in the end (delta: 4.3MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2025-03-08 21:52:18,244 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:52:18,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.58ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 47.5MB in the end (delta: 53.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 21:52:18,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.78ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 43.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:52:18,245 INFO L158 Benchmark]: Boogie Preprocessor took 28.48ms. Allocated memory is still 142.6MB. Free memory was 43.8MB in the beginning and 41.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:52:18,245 INFO L158 Benchmark]: IcfgBuilder took 472.83ms. Allocated memory is still 142.6MB. Free memory was 41.5MB in the beginning and 84.5MB in the end (delta: -43.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2025-03-08 21:52:18,245 INFO L158 Benchmark]: TraceAbstraction took 1398.65ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 35.3MB in the end (delta: 48.4MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2025-03-08 21:52:18,245 INFO L158 Benchmark]: Witness Printer took 74.89ms. Allocated memory is still 142.6MB. Free memory was 35.3MB in the beginning and 97.1MB in the end (delta: -61.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:52:18,246 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.27ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.58ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 47.5MB in the end (delta: 53.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.78ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 43.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.48ms. Allocated memory is still 142.6MB. Free memory was 43.8MB in the beginning and 41.5MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 472.83ms. Allocated memory is still 142.6MB. Free memory was 41.5MB in the beginning and 84.5MB in the end (delta: -43.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1398.65ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 35.3MB in the end (delta: 48.4MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * Witness Printer took 74.89ms. Allocated memory is still 142.6MB. Free memory was 35.3MB in the beginning and 97.1MB in the end (delta: -61.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1716]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1723]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1726]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1728]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1730]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1731]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 145 locations, 152 edges, 13 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: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 202 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 75 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 21:52:18,257 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 Result: TRUE