./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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-atomic/read_write_lock-1b.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 d6a3f8c57ab77e58af8013fe9ddd1fa7c1d656ac7e087660662f74a34f2abc91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:58:03,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:58:04,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:58:04,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:58:04,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:58:04,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:58:04,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:58:04,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:58:04,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:58:04,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:58:04,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:58:04,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:58:04,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:58:04,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:04,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:58:04,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:58:04,044 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 -> d6a3f8c57ab77e58af8013fe9ddd1fa7c1d656ac7e087660662f74a34f2abc91 [2025-03-13 21:58:04,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:58:04,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:58:04,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:58:04,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:58:04,305 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:58:04,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2025-03-13 21:58:05,537 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f752010/c06d9c2278904abbb94ded7f71c8d7f0/FLAGbbd21ff74 [2025-03-13 21:58:05,879 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:58:05,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2025-03-13 21:58:05,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f752010/c06d9c2278904abbb94ded7f71c8d7f0/FLAGbbd21ff74 [2025-03-13 21:58:06,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f752010/c06d9c2278904abbb94ded7f71c8d7f0 [2025-03-13 21:58:06,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:58:06,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:58:06,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:06,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:58:06,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:58:06,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3766fe35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06, skipping insertion in model container [2025-03-13 21:58:06,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:58:06,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:06,431 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:58:06,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:06,504 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:58:06,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06 WrapperNode [2025-03-13 21:58:06,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:06,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:06,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:58:06,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:58:06,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,543 INFO L138 Inliner]: procedures = 163, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2025-03-13 21:58:06,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:06,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:58:06,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:58:06,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:58:06,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:58:06,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:58:06,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:58:06,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:58:06,564 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (1/1) ... [2025-03-13 21:58:06,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:06,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:06,589 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-13 21:58:06,592 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-13 21:58:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockUnlock [2025-03-13 21:58:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockReadLock [2025-03-13 21:58:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:58:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-03-13 21:58:06,609 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-03-13 21:58:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockWriteLock [2025-03-13 21:58:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:58:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:58:06,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:58:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-13 21:58:06,609 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-13 21:58:06,610 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:58:06,708 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:58:06,710 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:58:06,845 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:58:06,845 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:58:06,845 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:58:06,869 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:58:06,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:06 BoogieIcfgContainer [2025-03-13 21:58:06,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:58:06,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:58:06,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:58:06,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:58:06,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:58:06" (1/3) ... [2025-03-13 21:58:06,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38720e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:06, skipping insertion in model container [2025-03-13 21:58:06,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:06" (2/3) ... [2025-03-13 21:58:06,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38720e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:06, skipping insertion in model container [2025-03-13 21:58:06,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:06" (3/3) ... [2025-03-13 21:58:06,878 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-1b.i [2025-03-13 21:58:06,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:58:06,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-1b.i that has 3 procedures, 102 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-03-13 21:58:06,892 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:58:06,968 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:58:06,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 147 transitions, 322 flow [2025-03-13 21:58:07,048 INFO L124 PetriNetUnfolderBase]: 4/143 cut-off events. [2025-03-13 21:58:07,050 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:58:07,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 143 events. 4/143 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 260 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2025-03-13 21:58:07,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 147 transitions, 322 flow [2025-03-13 21:58:07,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 138 transitions, 297 flow [2025-03-13 21:58:07,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:07,072 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;@7b16f974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:07,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-13 21:58:07,084 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:07,085 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2025-03-13 21:58:07,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:07,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:07,085 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] [2025-03-13 21:58:07,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr3ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 21:58:07,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1947153176, now seen corresponding path program 1 times [2025-03-13 21:58:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:07,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428103864] [2025-03-13 21:58:07,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:07,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:07,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:58:07,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:58:07,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:07,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:07,310 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-13 21:58:07,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428103864] [2025-03-13 21:58:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428103864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:07,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:07,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210657017] [2025-03-13 21:58:07,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:07,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:07,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:07,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:07,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:07,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 147 [2025-03-13 21:58:07,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 138 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-13 21:58:07,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:07,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 147 [2025-03-13 21:58:07,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:08,312 INFO L124 PetriNetUnfolderBase]: 2982/7601 cut-off events. [2025-03-13 21:58:08,312 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-03-13 21:58:08,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12534 conditions, 7601 events. 2982/7601 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 73435 event pairs, 2154 based on Foata normal form. 809/7398 useless extension candidates. Maximal degree in co-relation 12299. Up to 3608 conditions per place. [2025-03-13 21:58:08,378 INFO L140 encePairwiseOnDemand]: 134/147 looper letters, 33 selfloop transitions, 8 changer transitions 0/148 dead transitions. [2025-03-13 21:58:08,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 148 transitions, 408 flow [2025-03-13 21:58:08,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2025-03-13 21:58:08,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909297052154195 [2025-03-13 21:58:08,394 INFO L175 Difference]: Start difference. First operand has 147 places, 138 transitions, 297 flow. Second operand 3 states and 401 transitions. [2025-03-13 21:58:08,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 148 transitions, 408 flow [2025-03-13 21:58:08,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 148 transitions, 390 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-13 21:58:08,407 INFO L231 Difference]: Finished difference. Result has 142 places, 139 transitions, 334 flow [2025-03-13 21:58:08,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=142, PETRI_TRANSITIONS=139} [2025-03-13 21:58:08,412 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -5 predicate places. [2025-03-13 21:58:08,413 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 139 transitions, 334 flow [2025-03-13 21:58:08,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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-13 21:58:08,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:08,413 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-13 21:58:08,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:58:08,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr3ASSERT_VIOLATIONDATA_RACE === [readerErr3ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 21:58:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1152894252, now seen corresponding path program 1 times [2025-03-13 21:58:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767419578] [2025-03-13 21:58:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:08,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 21:58:08,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:58:08,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:08,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:08,491 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-13 21:58:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767419578] [2025-03-13 21:58:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767419578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:08,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:08,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:08,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505925722] [2025-03-13 21:58:08,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:08,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:08,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:08,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:08,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:08,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 147 [2025-03-13 21:58:08,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 139 transitions, 334 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-13 21:58:08,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:08,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 147 [2025-03-13 21:58:08,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:10,491 INFO L124 PetriNetUnfolderBase]: 9490/25323 cut-off events. [2025-03-13 21:58:10,492 INFO L125 PetriNetUnfolderBase]: For 6356/7074 co-relation queries the response was YES. [2025-03-13 21:58:10,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46461 conditions, 25323 events. 9490/25323 cut-off events. For 6356/7074 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 300747 event pairs, 3033 based on Foata normal form. 24/21365 useless extension candidates. Maximal degree in co-relation 41712. Up to 7778 conditions per place. [2025-03-13 21:58:10,744 INFO L140 encePairwiseOnDemand]: 133/147 looper letters, 47 selfloop transitions, 15 changer transitions 0/167 dead transitions. [2025-03-13 21:58:10,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 167 transitions, 554 flow [2025-03-13 21:58:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-03-13 21:58:10,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956916099773242 [2025-03-13 21:58:10,748 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 334 flow. Second operand 3 states and 395 transitions. [2025-03-13 21:58:10,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 167 transitions, 554 flow [2025-03-13 21:58:10,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 167 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:10,780 INFO L231 Difference]: Finished difference. Result has 144 places, 154 transitions, 468 flow [2025-03-13 21:58:10,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=144, PETRI_TRANSITIONS=154} [2025-03-13 21:58:10,782 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -3 predicate places. [2025-03-13 21:58:10,783 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 154 transitions, 468 flow [2025-03-13 21:58:10,783 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-13 21:58:10,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:10,783 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] [2025-03-13 21:58:10,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:58:10,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr2ASSERT_VIOLATIONDATA_RACE === [readerErr3ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 21:58:10,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash -333280466, now seen corresponding path program 1 times [2025-03-13 21:58:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:10,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591881393] [2025-03-13 21:58:10,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:10,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 21:58:10,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 21:58:10,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:10,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:10,850 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-13 21:58:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591881393] [2025-03-13 21:58:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591881393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:10,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:10,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:10,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194667700] [2025-03-13 21:58:10,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:10,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:10,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:10,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:10,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 147 [2025-03-13 21:58:10,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 154 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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-13 21:58:10,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:10,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 147 [2025-03-13 21:58:10,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:12,759 INFO L124 PetriNetUnfolderBase]: 10517/30535 cut-off events. [2025-03-13 21:58:12,760 INFO L125 PetriNetUnfolderBase]: For 7995/10010 co-relation queries the response was YES. [2025-03-13 21:58:12,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55861 conditions, 30535 events. 10517/30535 cut-off events. For 7995/10010 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 398619 event pairs, 5469 based on Foata normal form. 54/25968 useless extension candidates. Maximal degree in co-relation 51067. Up to 9255 conditions per place. [2025-03-13 21:58:12,992 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 31 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2025-03-13 21:58:12,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 167 transitions, 570 flow [2025-03-13 21:58:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2025-03-13 21:58:12,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8934240362811792 [2025-03-13 21:58:12,994 INFO L175 Difference]: Start difference. First operand has 144 places, 154 transitions, 468 flow. Second operand 3 states and 394 transitions. [2025-03-13 21:58:12,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 167 transitions, 570 flow [2025-03-13 21:58:13,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 167 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:13,013 INFO L231 Difference]: Finished difference. Result has 146 places, 158 transitions, 476 flow [2025-03-13 21:58:13,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=146, PETRI_TRANSITIONS=158} [2025-03-13 21:58:13,014 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -1 predicate places. [2025-03-13 21:58:13,014 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 158 transitions, 476 flow [2025-03-13 21:58:13,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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-13 21:58:13,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:13,014 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] [2025-03-13 21:58:13,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:58:13,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr3ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 21:58:13,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:13,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1548379573, now seen corresponding path program 1 times [2025-03-13 21:58:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506750396] [2025-03-13 21:58:13,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:13,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-13 21:58:13,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 21:58:13,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:13,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:13,172 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-13 21:58:13,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:13,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506750396] [2025-03-13 21:58:13,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506750396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:13,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029586267] [2025-03-13 21:58:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:13,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:13,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:13,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:13,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 147 [2025-03-13 21:58:13,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 158 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-13 21:58:13,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:13,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 147 [2025-03-13 21:58:13,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:13,381 INFO L124 PetriNetUnfolderBase]: 590/2985 cut-off events. [2025-03-13 21:58:13,381 INFO L125 PetriNetUnfolderBase]: For 571/856 co-relation queries the response was YES. [2025-03-13 21:58:13,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5355 conditions, 2985 events. 590/2985 cut-off events. For 571/856 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 30099 event pairs, 169 based on Foata normal form. 233/2603 useless extension candidates. Maximal degree in co-relation 3446. Up to 802 conditions per place. [2025-03-13 21:58:13,398 INFO L140 encePairwiseOnDemand]: 139/147 looper letters, 10 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2025-03-13 21:58:13,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 142 transitions, 465 flow [2025-03-13 21:58:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2025-03-13 21:58:13,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9024943310657596 [2025-03-13 21:58:13,400 INFO L175 Difference]: Start difference. First operand has 146 places, 158 transitions, 476 flow. Second operand 3 states and 398 transitions. [2025-03-13 21:58:13,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 142 transitions, 465 flow [2025-03-13 21:58:13,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 142 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:13,405 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 433 flow [2025-03-13 21:58:13,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=128, PETRI_TRANSITIONS=139} [2025-03-13 21:58:13,407 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -19 predicate places. [2025-03-13 21:58:13,407 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 433 flow [2025-03-13 21:58:13,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-13 21:58:13,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:13,408 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] [2025-03-13 21:58:13,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:58:13,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr3ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 21:58:13,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:13,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2058137397, now seen corresponding path program 2 times [2025-03-13 21:58:13,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:13,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383844135] [2025-03-13 21:58:13,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:13,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:13,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-03-13 21:58:13,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-13 21:58:13,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:58:13,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:13,542 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-13 21:58:13,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:13,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383844135] [2025-03-13 21:58:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383844135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:13,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:13,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:58:13,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170580392] [2025-03-13 21:58:13,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:13,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:13,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:13,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:13,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 147 [2025-03-13 21:58:13,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 139 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-13 21:58:13,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:13,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 147 [2025-03-13 21:58:13,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:13,597 INFO L124 PetriNetUnfolderBase]: 34/326 cut-off events. [2025-03-13 21:58:13,598 INFO L125 PetriNetUnfolderBase]: For 45/54 co-relation queries the response was YES. [2025-03-13 21:58:13,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 326 events. 34/326 cut-off events. For 45/54 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1304 event pairs, 18 based on Foata normal form. 7/288 useless extension candidates. Maximal degree in co-relation 435. Up to 58 conditions per place. [2025-03-13 21:58:13,599 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 10 selfloop transitions, 1 changer transitions 11/119 dead transitions. [2025-03-13 21:58:13,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 355 flow [2025-03-13 21:58:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2025-03-13 21:58:13,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-03-13 21:58:13,600 INFO L175 Difference]: Start difference. First operand has 128 places, 139 transitions, 433 flow. Second operand 3 states and 392 transitions. [2025-03-13 21:58:13,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 355 flow [2025-03-13 21:58:13,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 119 transitions, 337 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:13,604 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 283 flow [2025-03-13 21:58:13,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2025-03-13 21:58:13,606 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -22 predicate places. [2025-03-13 21:58:13,607 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 283 flow [2025-03-13 21:58:13,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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-13 21:58:13,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:13,608 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-13 21:58:13,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:58:13,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr1ASSERT_VIOLATIONDATA_RACE === [readerErr3ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 21:58:13,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1206253176, now seen corresponding path program 1 times [2025-03-13 21:58:13,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938261677] [2025-03-13 21:58:13,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:13,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:13,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 21:58:13,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 21:58:13,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:13,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:13,656 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-13 21:58:13,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:13,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938261677] [2025-03-13 21:58:13,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938261677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:13,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:13,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:13,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232495942] [2025-03-13 21:58:13,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:13,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:13,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:13,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:13,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 147 [2025-03-13 21:58:13,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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-13 21:58:13,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:13,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 147 [2025-03-13 21:58:13,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:13,712 INFO L124 PetriNetUnfolderBase]: 52/394 cut-off events. [2025-03-13 21:58:13,712 INFO L125 PetriNetUnfolderBase]: For 73/78 co-relation queries the response was YES. [2025-03-13 21:58:13,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 394 events. 52/394 cut-off events. For 73/78 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1937 event pairs, 21 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 649. Up to 76 conditions per place. [2025-03-13 21:58:13,714 INFO L140 encePairwiseOnDemand]: 139/147 looper letters, 20 selfloop transitions, 6 changer transitions 3/117 dead transitions. [2025-03-13 21:58:13,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 378 flow [2025-03-13 21:58:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2025-03-13 21:58:13,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8707482993197279 [2025-03-13 21:58:13,715 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 283 flow. Second operand 3 states and 384 transitions. [2025-03-13 21:58:13,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 378 flow [2025-03-13 21:58:13,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 373 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:13,718 INFO L231 Difference]: Finished difference. Result has 118 places, 110 transitions, 324 flow [2025-03-13 21:58:13,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=118, PETRI_TRANSITIONS=110} [2025-03-13 21:58:13,719 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -29 predicate places. [2025-03-13 21:58:13,719 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 324 flow [2025-03-13 21:58:13,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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-13 21:58:13,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:13,720 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] [2025-03-13 21:58:13,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:58:13,720 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting writerErr0ASSERT_VIOLATIONDATA_RACE === [readerErr3ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 21:58:13,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2089505491, now seen corresponding path program 1 times [2025-03-13 21:58:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:13,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142294757] [2025-03-13 21:58:13,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:13,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 21:58:13,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 21:58:13,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:13,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:13,761 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-13 21:58:13,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:13,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142294757] [2025-03-13 21:58:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142294757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:13,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667005339] [2025-03-13 21:58:13,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:13,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:13,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 147 [2025-03-13 21:58:13,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-13 21:58:13,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:13,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 147 [2025-03-13 21:58:13,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:13,819 INFO L124 PetriNetUnfolderBase]: 43/368 cut-off events. [2025-03-13 21:58:13,819 INFO L125 PetriNetUnfolderBase]: For 130/131 co-relation queries the response was YES. [2025-03-13 21:58:13,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 368 events. 43/368 cut-off events. For 130/131 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1749 event pairs, 25 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 661. Up to 70 conditions per place. [2025-03-13 21:58:13,820 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 14 selfloop transitions, 0 changer transitions 6/110 dead transitions. [2025-03-13 21:58:13,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 110 transitions, 362 flow [2025-03-13 21:58:13,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2025-03-13 21:58:13,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8299319727891157 [2025-03-13 21:58:13,822 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 324 flow. Second operand 3 states and 366 transitions. [2025-03-13 21:58:13,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 110 transitions, 362 flow [2025-03-13 21:58:13,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 110 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:13,824 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 295 flow [2025-03-13 21:58:13,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=295, PETRI_PLACES=117, PETRI_TRANSITIONS=104} [2025-03-13 21:58:13,826 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -30 predicate places. [2025-03-13 21:58:13,826 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 295 flow [2025-03-13 21:58:13,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-13 21:58:13,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:13,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:13,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:58:13,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr2ASSERT_VIOLATIONDATA_RACE === [readerErr3ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 21:58:13,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:13,827 INFO L85 PathProgramCache]: Analyzing trace with hash -421305579, now seen corresponding path program 1 times [2025-03-13 21:58:13,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:13,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319725422] [2025-03-13 21:58:13,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:13,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 21:58:13,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 21:58:13,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:13,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:13,861 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-13 21:58:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319725422] [2025-03-13 21:58:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319725422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:13,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241883455] [2025-03-13 21:58:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:13,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:13,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:13,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 147 [2025-03-13 21:58:13,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 104 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-13 21:58:13,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:13,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 147 [2025-03-13 21:58:13,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:13,916 INFO L124 PetriNetUnfolderBase]: 55/403 cut-off events. [2025-03-13 21:58:13,916 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-13 21:58:13,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 403 events. 55/403 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1993 event pairs, 27 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 769. Up to 88 conditions per place. [2025-03-13 21:58:13,918 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 18 selfloop transitions, 7 changer transitions 1/109 dead transitions. [2025-03-13 21:58:13,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 109 transitions, 365 flow [2025-03-13 21:58:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-03-13 21:58:13,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854875283446712 [2025-03-13 21:58:13,922 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 295 flow. Second operand 3 states and 377 transitions. [2025-03-13 21:58:13,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 109 transitions, 365 flow [2025-03-13 21:58:13,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 109 transitions, 359 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:13,925 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 339 flow [2025-03-13 21:58:13,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2025-03-13 21:58:13,926 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -34 predicate places. [2025-03-13 21:58:13,926 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 339 flow [2025-03-13 21:58:13,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-13 21:58:13,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:13,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:13,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:58:13,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr2ASSERT_VIOLATIONDATA_RACE === [readerErr3ASSERT_VIOLATIONDATA_RACE, readerErr2ASSERT_VIOLATIONDATA_RACE, readerErr1ASSERT_VIOLATIONDATA_RACE, readerErr0ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-13 21:58:13,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash 917382501, now seen corresponding path program 1 times [2025-03-13 21:58:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679905446] [2025-03-13 21:58:13,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:13,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 21:58:13,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 21:58:13,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:13,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:13,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:13,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 21:58:13,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 21:58:13,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:13,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:13,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:13,992 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:13,992 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr2ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2025-03-13 21:58:13,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-03-13 21:58:13,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-03-13 21:58:13,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-03-13 21:58:13,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-03-13 21:58:13,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:58:13,997 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:14,037 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:58:14,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:58:14,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:58:14 BasicIcfg [2025-03-13 21:58:14,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:58:14,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:58:14,043 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:58:14,043 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:58:14,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:06" (3/4) ... [2025-03-13 21:58:14,045 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:58:14,087 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-03-13 21:58:14,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:58:14,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:58:14,116 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:58:14,117 INFO L158 Benchmark]: Toolchain (without parser) took 7979.04ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 110.1MB in the beginning and 571.3MB in the end (delta: -461.2MB). Peak memory consumption was 971.0MB. Max. memory is 16.1GB. [2025-03-13 21:58:14,117 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:14,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.50ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 91.1MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:58:14,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.57ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:58:14,118 INFO L158 Benchmark]: Boogie Preprocessor took 16.75ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 88.1MB in the end (delta: 984.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:58:14,118 INFO L158 Benchmark]: IcfgBuilder took 307.73ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 72.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:58:14,118 INFO L158 Benchmark]: TraceAbstraction took 7170.06ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 71.4MB in the beginning and 583.9MB in the end (delta: -512.5MB). Peak memory consumption was 920.7MB. Max. memory is 16.1GB. [2025-03-13 21:58:14,118 INFO L158 Benchmark]: Witness Printer took 73.12ms. Allocated memory is still 1.6GB. Free memory was 583.9MB in the beginning and 571.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:58:14,119 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.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.50ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 91.1MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.57ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.75ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 88.1MB in the end (delta: 984.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.73ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 72.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7170.06ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 71.4MB in the beginning and 583.9MB in the end (delta: -512.5MB). Peak memory consumption was 920.7MB. Max. memory is 16.1GB. * Witness Printer took 73.12ms. Allocated memory is still 1.6GB. Free memory was 583.9MB in the beginning and 571.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 684]: Data race detected Data race detected The following path leads to a data race: [L674] 0 int x, y; VAL [x=0, y=0] [L675] 0 pthread_rwlock_t rwlock = { { 0, 0, 0, 0, 0, 0, PTHREAD_RWLOCK_DEFAULT_NP, 0, 0, 0, 0 } }; VAL [rwlock={3:0}, x=0, y=0] [L690] 0 pthread_t t1, t2, t3, t4; VAL [rwlock={3:0}, x=0, y=0] [L691] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [\old(arg)={0:0}, rwlock={3:0}, t1=-3, x=0, y=0] [L692] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [\old(arg)={0:0}, rwlock={3:0}, t1=-3, t2=-2, x=0, y=0] [L693] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [\old(arg)={0:0}, rwlock={3:0}, t1=-3, t2=-2, t3=-1, x=0, y=0] [L694] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [\old(arg)={0:0}, rwlock={3:0}, t1=-3, t2=-2, t3=-1, t4=0, x=0, y=0] [L684] 2 y = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, rwlock={3:0}, x=0, y=0] [L684] 4 y = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, rwlock={3:0}, x=0, y=0] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. - UnprovableResult [Line: 684]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: 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: 692]: 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: 693]: 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: 691]: 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: 678]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 190 locations, 19 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 39 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476occurred in iteration=3, InterpolantAutomatonStates: 24, 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.5s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-13 21:58:14,133 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)