./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/qw2004-1.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/pthread-lit/qw2004-1.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 3fb83c29fe591f537beeb8acce355ea986d79a29cfcecdcee0a9fb1725d601d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:52:03,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:52:03,128 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:03,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:52:03,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:52:03,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:52:03,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:52:03,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:52:03,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:52:03,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:52:03,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:52:03,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:52:03,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:52:03,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:52:03,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:52:03,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:52:03,150 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 -> 3fb83c29fe591f537beeb8acce355ea986d79a29cfcecdcee0a9fb1725d601d1 [2025-03-08 21:52:03,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:52:03,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:52:03,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:52:03,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:52:03,381 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:52:03,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004-1.i [2025-03-08 21:52:04,534 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942c0d6eb/0c981248fa6e4fe9a72380e33fa385f4/FLAGec5af242f [2025-03-08 21:52:04,824 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:52:04,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-1.i [2025-03-08 21:52:04,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942c0d6eb/0c981248fa6e4fe9a72380e33fa385f4/FLAGec5af242f [2025-03-08 21:52:04,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/942c0d6eb/0c981248fa6e4fe9a72380e33fa385f4 [2025-03-08 21:52:04,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:52:04,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:52:04,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:52:04,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:52:04,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:52:04,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:52:04" (1/1) ... [2025-03-08 21:52:04,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:04, skipping insertion in model container [2025-03-08 21:52:04,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:52:04" (1/1) ... [2025-03-08 21:52:04,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:52:05,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:52:05,100 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:52:05,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:52:05,168 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:52:05,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:05 WrapperNode [2025-03-08 21:52:05,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:52:05,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:52:05,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:52:05,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:52:05,175 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:05" (1/1) ... [2025-03-08 21:52:05,184 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:05" (1/1) ... [2025-03-08 21:52:05,201 INFO L138 Inliner]: procedures = 174, calls = 20, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 155 [2025-03-08 21:52:05,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:52:05,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:52:05,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:52:05,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:52:05,208 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:05" (1/1) ... [2025-03-08 21:52:05,208 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:05" (1/1) ... [2025-03-08 21:52:05,210 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:05" (1/1) ... [2025-03-08 21:52:05,210 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:05" (1/1) ... [2025-03-08 21:52:05,213 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:05" (1/1) ... [2025-03-08 21:52:05,213 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:05" (1/1) ... [2025-03-08 21:52:05,214 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:05" (1/1) ... [2025-03-08 21:52:05,215 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:05" (1/1) ... [2025-03-08 21:52:05,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:52:05,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:52:05,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:52:05,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:52:05,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:05" (1/1) ... [2025-03-08 21:52:05,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:52:05,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:52:05,246 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:05,248 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:05,263 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-03-08 21:52:05,264 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-03-08 21:52:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 21:52:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:52:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:52:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 21:52:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:52:05,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:52:05,265 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:05,352 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:52:05,353 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:52:05,562 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:52:05,562 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:52:05,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:52:05,621 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:52:05,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:52:05 BoogieIcfgContainer [2025-03-08 21:52:05,622 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:52:05,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:52:05,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:52:05,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:52:05,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:52:04" (1/3) ... [2025-03-08 21:52:05,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1611dde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:52:05, skipping insertion in model container [2025-03-08 21:52:05,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:52:05" (2/3) ... [2025-03-08 21:52:05,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1611dde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:52:05, skipping insertion in model container [2025-03-08 21:52:05,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:52:05" (3/3) ... [2025-03-08 21:52:05,630 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004-1.i [2025-03-08 21:52:05,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:52:05,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004-1.i that has 2 procedures, 156 locations, 1 initial locations, 0 loop locations, and 19 error locations. [2025-03-08 21:52:05,643 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:52:05,697 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:52:05,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 162 transitions, 328 flow [2025-03-08 21:52:05,780 INFO L124 PetriNetUnfolderBase]: 7/161 cut-off events. [2025-03-08 21:52:05,782 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:52:05,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 161 events. 7/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 286 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2025-03-08 21:52:05,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 162 transitions, 328 flow [2025-03-08 21:52:05,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 161 transitions, 325 flow [2025-03-08 21:52:05,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:52:05,806 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;@60c53d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:52:05,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-08 21:52:05,812 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:52:05,812 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-03-08 21:52:05,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:52:05,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:05,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:52:05,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-08 21:52:05,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash -397103009, now seen corresponding path program 1 times [2025-03-08 21:52:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:05,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162665499] [2025-03-08 21:52:05,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:05,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:05,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 21:52:05,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 21:52:05,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:05,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:05,979 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:05,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:05,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162665499] [2025-03-08 21:52:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162665499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:05,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:05,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731826657] [2025-03-08 21:52:05,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:05,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:05,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:06,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:06,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:06,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2025-03-08 21:52:06,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 161 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:06,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:06,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2025-03-08 21:52:06,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:06,078 INFO L124 PetriNetUnfolderBase]: 11/202 cut-off events. [2025-03-08 21:52:06,079 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:52:06,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 202 events. 11/202 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 517 event pairs, 4 based on Foata normal form. 7/186 useless extension candidates. Maximal degree in co-relation 175. Up to 18 conditions per place. [2025-03-08 21:52:06,082 INFO L140 encePairwiseOnDemand]: 147/162 looper letters, 9 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-03-08 21:52:06,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 146 transitions, 317 flow [2025-03-08 21:52:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2025-03-08 21:52:06,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8950617283950617 [2025-03-08 21:52:06,097 INFO L175 Difference]: Start difference. First operand has 158 places, 161 transitions, 325 flow. Second operand 3 states and 435 transitions. [2025-03-08 21:52:06,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 146 transitions, 317 flow [2025-03-08 21:52:06,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 146 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:52:06,104 INFO L231 Difference]: Finished difference. Result has 147 places, 146 transitions, 298 flow [2025-03-08 21:52:06,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=147, PETRI_TRANSITIONS=146} [2025-03-08 21:52:06,108 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -11 predicate places. [2025-03-08 21:52:06,110 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 146 transitions, 298 flow [2025-03-08 21:52:06,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:06,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:06,111 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] [2025-03-08 21:52:06,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:52:06,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-08 21:52:06,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 808976303, now seen corresponding path program 1 times [2025-03-08 21:52:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:06,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910207337] [2025-03-08 21:52:06,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:06,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 21:52:06,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 21:52:06,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:06,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:06,156 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:06,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:06,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910207337] [2025-03-08 21:52:06,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910207337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:06,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:06,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:06,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582975659] [2025-03-08 21:52:06,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:06,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:06,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:06,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:06,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:06,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 162 [2025-03-08 21:52:06,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 146 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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:06,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:06,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 162 [2025-03-08 21:52:06,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:06,234 INFO L124 PetriNetUnfolderBase]: 16/321 cut-off events. [2025-03-08 21:52:06,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:52:06,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 321 events. 16/321 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1064 event pairs, 8 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 332. Up to 27 conditions per place. [2025-03-08 21:52:06,239 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 10 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-03-08 21:52:06,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 145 transitions, 320 flow [2025-03-08 21:52:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2025-03-08 21:52:06,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8662551440329218 [2025-03-08 21:52:06,244 INFO L175 Difference]: Start difference. First operand has 147 places, 146 transitions, 298 flow. Second operand 3 states and 421 transitions. [2025-03-08 21:52:06,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 145 transitions, 320 flow [2025-03-08 21:52:06,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 145 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:06,247 INFO L231 Difference]: Finished difference. Result has 146 places, 145 transitions, 296 flow [2025-03-08 21:52:06,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=146, PETRI_TRANSITIONS=145} [2025-03-08 21:52:06,248 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -12 predicate places. [2025-03-08 21:52:06,249 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 296 flow [2025-03-08 21:52:06,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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:06,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:06,249 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:06,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:52:06,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-08 21:52:06,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1201470988, now seen corresponding path program 1 times [2025-03-08 21:52:06,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:06,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591659853] [2025-03-08 21:52:06,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:06,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:06,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 21:52:06,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 21:52:06,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:06,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:06,307 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:06,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:06,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591659853] [2025-03-08 21:52:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591659853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:06,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586561612] [2025-03-08 21:52:06,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:06,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:06,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:06,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:06,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 162 [2025-03-08 21:52:06,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 145 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:06,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:06,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 162 [2025-03-08 21:52:06,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:06,375 INFO L124 PetriNetUnfolderBase]: 28/315 cut-off events. [2025-03-08 21:52:06,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:52:06,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 315 events. 28/315 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1270 event pairs, 15 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 337. Up to 43 conditions per place. [2025-03-08 21:52:06,378 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 12 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-03-08 21:52:06,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 322 flow [2025-03-08 21:52:06,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2025-03-08 21:52:06,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8580246913580247 [2025-03-08 21:52:06,381 INFO L175 Difference]: Start difference. First operand has 146 places, 145 transitions, 296 flow. Second operand 3 states and 417 transitions. [2025-03-08 21:52:06,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 322 flow [2025-03-08 21:52:06,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 144 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:06,385 INFO L231 Difference]: Finished difference. Result has 145 places, 144 transitions, 294 flow [2025-03-08 21:52:06,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=145, PETRI_TRANSITIONS=144} [2025-03-08 21:52:06,386 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -13 predicate places. [2025-03-08 21:52:06,386 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 144 transitions, 294 flow [2025-03-08 21:52:06,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:06,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:06,386 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] [2025-03-08 21:52:06,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:52:06,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-08 21:52:06,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1966259067, now seen corresponding path program 1 times [2025-03-08 21:52:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818273518] [2025-03-08 21:52:06,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:06,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 21:52:06,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 21:52:06,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:06,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:06,436 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:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:06,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818273518] [2025-03-08 21:52:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818273518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:06,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311802368] [2025-03-08 21:52:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:06,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:06,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:06,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:06,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:06,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 162 [2025-03-08 21:52:06,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 144 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:06,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:06,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 162 [2025-03-08 21:52:06,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:06,486 INFO L124 PetriNetUnfolderBase]: 20/257 cut-off events. [2025-03-08 21:52:06,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:52:06,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 257 events. 20/257 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 808 event pairs, 10 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 263. Up to 32 conditions per place. [2025-03-08 21:52:06,488 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 11 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2025-03-08 21:52:06,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 143 transitions, 318 flow [2025-03-08 21:52:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2025-03-08 21:52:06,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8621399176954733 [2025-03-08 21:52:06,489 INFO L175 Difference]: Start difference. First operand has 145 places, 144 transitions, 294 flow. Second operand 3 states and 419 transitions. [2025-03-08 21:52:06,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 143 transitions, 318 flow [2025-03-08 21:52:06,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 143 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:06,491 INFO L231 Difference]: Finished difference. Result has 144 places, 143 transitions, 292 flow [2025-03-08 21:52:06,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=144, PETRI_TRANSITIONS=143} [2025-03-08 21:52:06,496 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -14 predicate places. [2025-03-08 21:52:06,496 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 143 transitions, 292 flow [2025-03-08 21:52:06,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:06,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:06,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:52:06,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:52:06,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-08 21:52:06,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash -421490247, now seen corresponding path program 1 times [2025-03-08 21:52:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:06,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414438109] [2025-03-08 21:52:06,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:06,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 21:52:06,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 21:52:06,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:06,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:52:06,575 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:06,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:52:06,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414438109] [2025-03-08 21:52:06,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414438109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:52:06,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:52:06,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:52:06,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204955810] [2025-03-08 21:52:06,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:52:06,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:52:06,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:52:06,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:52:06,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:52:06,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 162 [2025-03-08 21:52:06,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 143 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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:06,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:52:06,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 162 [2025-03-08 21:52:06,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:52:06,624 INFO L124 PetriNetUnfolderBase]: 32/417 cut-off events. [2025-03-08 21:52:06,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:52:06,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 417 events. 32/417 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2046 event pairs, 9 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 437. Up to 40 conditions per place. [2025-03-08 21:52:06,627 INFO L140 encePairwiseOnDemand]: 156/162 looper letters, 11 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2025-03-08 21:52:06,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 148 transitions, 334 flow [2025-03-08 21:52:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:52:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:52:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2025-03-08 21:52:06,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868312757201646 [2025-03-08 21:52:06,629 INFO L175 Difference]: Start difference. First operand has 144 places, 143 transitions, 292 flow. Second operand 3 states and 431 transitions. [2025-03-08 21:52:06,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 148 transitions, 334 flow [2025-03-08 21:52:06,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 148 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:52:06,632 INFO L231 Difference]: Finished difference. Result has 146 places, 147 transitions, 326 flow [2025-03-08 21:52:06,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=146, PETRI_TRANSITIONS=147} [2025-03-08 21:52:06,634 INFO L279 CegarLoopForPetriNet]: 158 programPoint places, -12 predicate places. [2025-03-08 21:52:06,635 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 147 transitions, 326 flow [2025-03-08 21:52:06,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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:06,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:52:06,635 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] [2025-03-08 21:52:06,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:52:06,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-08 21:52:06,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:52:06,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1357057409, now seen corresponding path program 1 times [2025-03-08 21:52:06,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:52:06,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681752905] [2025-03-08 21:52:06,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:52:06,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:52:06,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 21:52:06,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 21:52:06,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:06,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:52:06,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:52:06,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 21:52:06,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 21:52:06,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:52:06,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:52:06,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:52:06,676 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:52:06,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2025-03-08 21:52:06,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 27 remaining) [2025-03-08 21:52:06,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2025-03-08 21:52:06,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2025-03-08 21:52:06,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2025-03-08 21:52:06,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2025-03-08 21:52:06,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2025-03-08 21:52:06,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2025-03-08 21:52:06,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:52:06,681 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 21:52:06,717 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:52:06,717 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:52:06,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:52:06 BasicIcfg [2025-03-08 21:52:06,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:52:06,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:52:06,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:52:06,724 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:52:06,726 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:05" (3/4) ... [2025-03-08 21:52:06,727 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:52:06,774 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-03-08 21:52:06,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:52:06,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:52:06,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:52:06,806 INFO L158 Benchmark]: Toolchain (without parser) took 1945.40ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 69.8MB in the end (delta: 35.2MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2025-03-08 21:52:06,806 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:52:06,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.25ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 85.9MB in the end (delta: 19.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:52:06,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.39ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:52:06,808 INFO L158 Benchmark]: Boogie Preprocessor took 18.62ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.3MB in the end (delta: 950.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:52:06,808 INFO L158 Benchmark]: IcfgBuilder took 400.61ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 60.8MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:52:06,808 INFO L158 Benchmark]: TraceAbstraction took 1099.38ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 77.9MB in the end (delta: -17.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:52:06,809 INFO L158 Benchmark]: Witness Printer took 81.32ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 69.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:52:06,810 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.13ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.25ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 85.9MB in the end (delta: 19.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.39ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.62ms. Allocated memory is still 142.6MB. Free memory was 83.2MB in the beginning and 82.3MB in the end (delta: 950.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 400.61ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 60.8MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1099.38ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 77.9MB in the end (delta: -17.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 81.32ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 69.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 736]: 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] [L743] 0 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L744] 0 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L745] 0 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L746] 0 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L747] 0 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L748] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L749] CALL 0 BCSP_PnpAdd(0) [L727] 0 int status; VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L728] CALL 0 BCSP_IoIncrement() [L736] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L703] 0 \read(stoppingFlag) [L703] 0 \read(stoppingFlag) [L703] COND TRUE 0 \read(stoppingFlag) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L736] 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 [736] - 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: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: 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: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 745]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: 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: 730]: 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: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: 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 3 procedures, 205 locations, 212 edges, 27 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.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 25 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=5, InterpolantAutomatonStates: 15, 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.2s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-08 21:52:06,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)