./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/qw2004_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/qw2004_variant.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 1ad14026eba5b252f16e1e7c5b06294a08c72d8fedf1d2cbda596d8ea988add3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:58:58,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:58:59,005 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:58:59,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:58:59,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:58:59,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:58:59,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:58:59,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:58:59,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:58:59,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:58:59,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:58:59,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:58:59,037 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:58:59,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:58:59,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:58:59,037 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:58:59,037 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:58:59,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:58:59,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:58:59,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:58:59,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:58:59,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:58:59,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:58:59,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:58:59,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:58:59,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:58:59,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:58:59,039 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 -> 1ad14026eba5b252f16e1e7c5b06294a08c72d8fedf1d2cbda596d8ea988add3 [2025-03-17 10:58:59,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:58:59,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:58:59,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:58:59,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:58:59,274 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:58:59,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004_variant.i [2025-03-17 10:59:00,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d3cc0b48/6bd244b715bb426784a547f44e66ba3d/FLAG346763687 [2025-03-17 10:59:00,752 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:59:00,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004_variant.i [2025-03-17 10:59:00,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d3cc0b48/6bd244b715bb426784a547f44e66ba3d/FLAG346763687 [2025-03-17 10:59:01,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d3cc0b48/6bd244b715bb426784a547f44e66ba3d [2025-03-17 10:59:01,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:59:01,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:59:01,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:01,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:59:01,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:59:01,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7598d423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01, skipping insertion in model container [2025-03-17 10:59:01,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:59:01,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:01,331 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:59:01,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:59:01,412 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:59:01,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01 WrapperNode [2025-03-17 10:59:01,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:59:01,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:01,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:59:01,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:59:01,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,455 INFO L138 Inliner]: procedures = 173, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2025-03-17 10:59:01,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:59:01,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:59:01,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:59:01,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:59:01,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,468 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:59:01,481 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:59:01,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:59:01,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:59:01,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (1/1) ... [2025-03-17 10:59:01,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:59:01,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:59:01,514 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-17 10:59:01,520 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-17 10:59:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-03-17 10:59:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-03-17 10:59:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 10:59:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:59:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpAdd [2025-03-17 10:59:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpAdd [2025-03-17 10:59:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:59:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 10:59:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:59:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:59:01,536 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:59:01,629 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:59:01,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:59:01,836 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:59:01,836 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:59:01,903 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:59:01,904 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:59:01,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:01 BoogieIcfgContainer [2025-03-17 10:59:01,905 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:59:01,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:59:01,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:59:01,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:59:01,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:59:01" (1/3) ... [2025-03-17 10:59:01,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecbe11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:01, skipping insertion in model container [2025-03-17 10:59:01,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:59:01" (2/3) ... [2025-03-17 10:59:01,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecbe11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:59:01, skipping insertion in model container [2025-03-17 10:59:01,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:01" (3/3) ... [2025-03-17 10:59:01,911 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004_variant.i [2025-03-17 10:59:01,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:59:01,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004_variant.i that has 3 procedures, 133 locations, 1 initial locations, 1 loop locations, and 19 error locations. [2025-03-17 10:59:01,925 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:59:01,983 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:59:02,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 138 transitions, 284 flow [2025-03-17 10:59:02,065 INFO L124 PetriNetUnfolderBase]: 5/146 cut-off events. [2025-03-17 10:59:02,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:02,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 146 events. 5/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 257 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2025-03-17 10:59:02,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 138 transitions, 284 flow [2025-03-17 10:59:02,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 137 transitions, 281 flow [2025-03-17 10:59:02,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:59:02,101 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;@56d31c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:59:02,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-17 10:59:02,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:59:02,110 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-17 10:59:02,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:59:02,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:02,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:02,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-17 10:59:02,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1745010059, now seen corresponding path program 1 times [2025-03-17 10:59:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:02,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714000483] [2025-03-17 10:59:02,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:02,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:02,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 10:59:02,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 10:59:02,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:02,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:02,293 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-17 10:59:02,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714000483] [2025-03-17 10:59:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714000483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:02,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:02,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754403229] [2025-03-17 10:59:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:02,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:02,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:02,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:02,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138 [2025-03-17 10:59:02,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 137 transitions, 281 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-17 10:59:02,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:02,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138 [2025-03-17 10:59:02,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:02,421 INFO L124 PetriNetUnfolderBase]: 23/250 cut-off events. [2025-03-17 10:59:02,421 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 10:59:02,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 250 events. 23/250 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 873 event pairs, 15 based on Foata normal form. 17/237 useless extension candidates. Maximal degree in co-relation 247. Up to 39 conditions per place. [2025-03-17 10:59:02,424 INFO L140 encePairwiseOnDemand]: 121/138 looper letters, 10 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2025-03-17 10:59:02,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 271 flow [2025-03-17 10:59:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-03-17 10:59:02,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8623188405797102 [2025-03-17 10:59:02,436 INFO L175 Difference]: Start difference. First operand has 138 places, 137 transitions, 281 flow. Second operand 3 states and 357 transitions. [2025-03-17 10:59:02,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 271 flow [2025-03-17 10:59:02,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 120 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:59:02,443 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 250 flow [2025-03-17 10:59:02,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2025-03-17 10:59:02,452 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -13 predicate places. [2025-03-17 10:59:02,452 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 250 flow [2025-03-17 10:59:02,453 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-17 10:59:02,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:02,453 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] [2025-03-17 10:59:02,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:59:02,453 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-17 10:59:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash -852495331, now seen corresponding path program 1 times [2025-03-17 10:59:02,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:02,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544071414] [2025-03-17 10:59:02,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:02,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 10:59:02,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 10:59:02,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:02,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:02,486 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-17 10:59:02,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544071414] [2025-03-17 10:59:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544071414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:02,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096306715] [2025-03-17 10:59:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:02,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:02,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:02,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:02,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 138 [2025-03-17 10:59:02,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-17 10:59:02,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:02,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 138 [2025-03-17 10:59:02,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:02,578 INFO L124 PetriNetUnfolderBase]: 35/389 cut-off events. [2025-03-17 10:59:02,578 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 10:59:02,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 389 events. 35/389 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1856 event pairs, 27 based on Foata normal form. 0/330 useless extension candidates. Maximal degree in co-relation 439. Up to 61 conditions per place. [2025-03-17 10:59:02,583 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 11 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2025-03-17 10:59:02,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 119 transitions, 274 flow [2025-03-17 10:59:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2025-03-17 10:59:02,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8236714975845411 [2025-03-17 10:59:02,588 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 250 flow. Second operand 3 states and 341 transitions. [2025-03-17 10:59:02,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 119 transitions, 274 flow [2025-03-17 10:59:02,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 119 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:02,591 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 248 flow [2025-03-17 10:59:02,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=124, PETRI_TRANSITIONS=119} [2025-03-17 10:59:02,592 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -14 predicate places. [2025-03-17 10:59:02,592 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 248 flow [2025-03-17 10:59:02,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-17 10:59:02,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:02,593 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] [2025-03-17 10:59:02,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:59:02,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-17 10:59:02,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1155382688, now seen corresponding path program 1 times [2025-03-17 10:59:02,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:02,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253787589] [2025-03-17 10:59:02,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:02,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:02,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:59:02,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:59:02,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:02,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:02,628 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-17 10:59:02,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:02,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253787589] [2025-03-17 10:59:02,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253787589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:02,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:02,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605130944] [2025-03-17 10:59:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:02,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:02,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:02,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:02,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:02,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 138 [2025-03-17 10:59:02,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 119 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-17 10:59:02,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:02,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 138 [2025-03-17 10:59:02,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:02,683 INFO L124 PetriNetUnfolderBase]: 39/338 cut-off events. [2025-03-17 10:59:02,683 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 10:59:02,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 338 events. 39/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1493 event pairs, 27 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 383. Up to 61 conditions per place. [2025-03-17 10:59:02,685 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 11 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2025-03-17 10:59:02,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 118 transitions, 272 flow [2025-03-17 10:59:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2025-03-17 10:59:02,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8236714975845411 [2025-03-17 10:59:02,687 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 248 flow. Second operand 3 states and 341 transitions. [2025-03-17 10:59:02,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 118 transitions, 272 flow [2025-03-17 10:59:02,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 118 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:02,689 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 246 flow [2025-03-17 10:59:02,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2025-03-17 10:59:02,690 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -15 predicate places. [2025-03-17 10:59:02,690 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 246 flow [2025-03-17 10:59:02,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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-17 10:59:02,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:02,690 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] [2025-03-17 10:59:02,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:59:02,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-17 10:59:02,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1088897482, now seen corresponding path program 1 times [2025-03-17 10:59:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:02,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937692181] [2025-03-17 10:59:02,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:02,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 10:59:02,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 10:59:02,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:02,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:02,742 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-17 10:59:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:02,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937692181] [2025-03-17 10:59:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937692181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:02,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:02,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:02,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289539671] [2025-03-17 10:59:02,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:02,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:02,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:02,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:02,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:02,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 138 [2025-03-17 10:59:02,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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-17 10:59:02,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:02,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 138 [2025-03-17 10:59:02,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:02,838 INFO L124 PetriNetUnfolderBase]: 46/344 cut-off events. [2025-03-17 10:59:02,838 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 10:59:02,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 344 events. 46/344 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1517 event pairs, 34 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 397. Up to 74 conditions per place. [2025-03-17 10:59:02,841 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 12 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-03-17 10:59:02,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 117 transitions, 272 flow [2025-03-17 10:59:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2025-03-17 10:59:02,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8188405797101449 [2025-03-17 10:59:02,843 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 246 flow. Second operand 3 states and 339 transitions. [2025-03-17 10:59:02,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 117 transitions, 272 flow [2025-03-17 10:59:02,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 117 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:02,847 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 244 flow [2025-03-17 10:59:02,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2025-03-17 10:59:02,848 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -16 predicate places. [2025-03-17 10:59:02,848 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 244 flow [2025-03-17 10:59:02,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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-17 10:59:02,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:02,849 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-17 10:59:02,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:59:02,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-17 10:59:02,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash 548969915, now seen corresponding path program 1 times [2025-03-17 10:59:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371564163] [2025-03-17 10:59:02,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:02,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:02,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 10:59:02,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 10:59:02,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:02,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:02,888 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-17 10:59:02,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:02,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371564163] [2025-03-17 10:59:02,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371564163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:02,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:02,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289085773] [2025-03-17 10:59:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:02,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:02,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:02,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:02,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2025-03-17 10:59:02,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-17 10:59:02,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:02,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2025-03-17 10:59:02,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:02,946 INFO L124 PetriNetUnfolderBase]: 29/307 cut-off events. [2025-03-17 10:59:02,947 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 10:59:02,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 307 events. 29/307 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1249 event pairs, 13 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 349. Up to 47 conditions per place. [2025-03-17 10:59:02,948 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-17 10:59:02,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 123 transitions, 295 flow [2025-03-17 10:59:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2025-03-17 10:59:02,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2025-03-17 10:59:02,950 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 244 flow. Second operand 3 states and 352 transitions. [2025-03-17 10:59:02,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 123 transitions, 295 flow [2025-03-17 10:59:02,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 123 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:02,953 INFO L231 Difference]: Finished difference. Result has 124 places, 121 transitions, 278 flow [2025-03-17 10:59:02,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=124, PETRI_TRANSITIONS=121} [2025-03-17 10:59:02,955 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -14 predicate places. [2025-03-17 10:59:02,955 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 121 transitions, 278 flow [2025-03-17 10:59:02,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-17 10:59:02,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:02,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:02,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:59:02,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-17 10:59:02,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:02,956 INFO L85 PathProgramCache]: Analyzing trace with hash 254114558, now seen corresponding path program 1 times [2025-03-17 10:59:02,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:02,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253574458] [2025-03-17 10:59:02,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:02,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 10:59:02,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 10:59:02,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:02,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:59:03,011 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-17 10:59:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:59:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253574458] [2025-03-17 10:59:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253574458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:59:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:59:03,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:59:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078518837] [2025-03-17 10:59:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:59:03,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:59:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:59:03,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:59:03,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:59:03,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2025-03-17 10:59:03,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 121 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-17 10:59:03,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:59:03,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2025-03-17 10:59:03,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:59:03,079 INFO L124 PetriNetUnfolderBase]: 23/310 cut-off events. [2025-03-17 10:59:03,079 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-17 10:59:03,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 310 events. 23/310 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1317 event pairs, 6 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 362. Up to 27 conditions per place. [2025-03-17 10:59:03,081 INFO L140 encePairwiseOnDemand]: 134/138 looper letters, 14 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-03-17 10:59:03,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 329 flow [2025-03-17 10:59:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:59:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:59:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2025-03-17 10:59:03,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.857487922705314 [2025-03-17 10:59:03,083 INFO L175 Difference]: Start difference. First operand has 124 places, 121 transitions, 278 flow. Second operand 3 states and 355 transitions. [2025-03-17 10:59:03,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 329 flow [2025-03-17 10:59:03,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 126 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:59:03,085 INFO L231 Difference]: Finished difference. Result has 126 places, 123 transitions, 290 flow [2025-03-17 10:59:03,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=126, PETRI_TRANSITIONS=123} [2025-03-17 10:59:03,086 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -12 predicate places. [2025-03-17 10:59:03,086 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 123 transitions, 290 flow [2025-03-17 10:59:03,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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-17 10:59:03,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:59:03,087 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] [2025-03-17 10:59:03,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:59:03,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-03-17 10:59:03,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:59:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1484543877, now seen corresponding path program 1 times [2025-03-17 10:59:03,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:59:03,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543552207] [2025-03-17 10:59:03,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:59:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:59:03,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 10:59:03,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 10:59:03,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:03,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:59:03,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:59:03,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 10:59:03,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 10:59:03,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:59:03,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:59:03,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:59:03,128 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:59:03,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (35 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr7ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr6ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-03-17 10:59:03,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr5ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr4ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr3ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr2ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr1ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr0ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr7ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr6ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr5ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr4ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr3ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-03-17 10:59:03,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr2ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-03-17 10:59:03,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr1ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-03-17 10:59:03,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr0ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-03-17 10:59:03,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:59:03,132 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:59:03,185 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:59:03,185 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:59:03,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:59:03 BasicIcfg [2025-03-17 10:59:03,189 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:59:03,189 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:59:03,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:59:03,189 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:59:03,190 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:59:01" (3/4) ... [2025-03-17 10:59:03,190 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 10:59:03,230 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-03-17 10:59:03,256 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:59:03,256 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:59:03,256 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:59:03,258 INFO L158 Benchmark]: Toolchain (without parser) took 2231.63ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 102.8MB in the end (delta: 6.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:03,258 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:03,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.88ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 89.1MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 10:59:03,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.74ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:03,261 INFO L158 Benchmark]: Boogie Preprocessor took 24.54ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 86.1MB in the end (delta: 979.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:59:03,262 INFO L158 Benchmark]: IcfgBuilder took 423.54ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 61.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 10:59:03,262 INFO L158 Benchmark]: TraceAbstraction took 1282.28ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 112.4MB in the end (delta: -51.4MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2025-03-17 10:59:03,262 INFO L158 Benchmark]: Witness Printer took 67.11ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 102.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:59:03,263 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.34ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.88ms. Allocated memory is still 142.6MB. Free memory was 108.8MB in the beginning and 89.1MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.74ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.54ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 86.1MB in the end (delta: 979.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 423.54ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 61.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1282.28ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 112.4MB in the end (delta: -51.4MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 67.11ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 102.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 730]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int stoppingFlag; VAL [stoppingFlag=0] [L698] 0 volatile int pendingIo; VAL [pendingIo=0, stoppingFlag=0] [L699] 0 volatile int stoppingEvent; VAL [pendingIo=0, stoppingEvent=0, stoppingFlag=0] [L700] 0 volatile int stopped; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L737] 0 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L738] 0 int i; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L739] 0 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L740] 0 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L741] 0 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L742] 0 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L743] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L730] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L744] 0 i = 0 VAL [i=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1, t=-1] [L744] COND TRUE 0 i < 10 VAL [i=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1, t=-1] [L745] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpAdd, 0) VAL [i=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1, t=0] [L721] 2 int status; VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L722] CALL 2 BCSP_IoIncrement() [L703] 2 \read(stoppingFlag) [L703] 2 \read(stoppingFlag) [L703] COND TRUE 2 \read(stoppingFlag) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L730] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] Now there is a data race on ~stoppingFlag~0 between C: if (stoppingFlag) { __VERIFIER_atomic_end(); return -1; } else { pendingIo = pendingIo + 1; } [703-708] and C: stoppingFlag = 1 [730] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 740]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 743]: 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: 745]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 208 locations, 216 edges, 36 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.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 155 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 14 mSDtfsCounter, 155 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=290occurred in iteration=6, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 200 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-17 10:59:03,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)