./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 08:57:48,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:57:48,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 08:57:48,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:57:48,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:57:48,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:57:48,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:57:48,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:57:48,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:57:48,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:57:48,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:57:48,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:57:48,130 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:57:48,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:57:48,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:57:48,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:57:48,133 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-jdk21/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-02-06 08:57:48,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:57:48,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:57:48,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:57:48,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:57:48,368 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:57:48,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2025-02-06 08:57:49,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/679530b1c/f42e212464cf407084e99b2d2f8c9cef/FLAG8a704f429 [2025-02-06 08:57:49,932 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:57:49,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1b.i [2025-02-06 08:57:49,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/679530b1c/f42e212464cf407084e99b2d2f8c9cef/FLAG8a704f429 [2025-02-06 08:57:50,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/679530b1c/f42e212464cf407084e99b2d2f8c9cef [2025-02-06 08:57:50,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:57:50,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:57:50,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:57:50,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:57:50,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:57:50,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741d628a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50, skipping insertion in model container [2025-02-06 08:57:50,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:57:50,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:57:50,462 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:57:50,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:57:50,516 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:57:50,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50 WrapperNode [2025-02-06 08:57:50,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:57:50,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:57:50,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:57:50,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:57:50,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,547 INFO L138 Inliner]: procedures = 163, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2025-02-06 08:57:50,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:57:50,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:57:50,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:57:50,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:57:50,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:57:50,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:57:50,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:57:50,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:57:50,586 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (1/1) ... [2025-02-06 08:57:50,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:57:50,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:57:50,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:57:50,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:57:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockUnlock [2025-02-06 08:57:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockReadLock [2025-02-06 08:57:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:57:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-02-06 08:57:50,635 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-02-06 08:57:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsRwLockWriteLock [2025-02-06 08:57:50,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 08:57:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:57:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:57:50,636 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-02-06 08:57:50,636 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-02-06 08:57:50,637 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 08:57:50,756 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:57:50,758 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:57:50,917 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 08:57:50,917 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:57:50,943 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:57:50,944 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:57:50,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:57:50 BoogieIcfgContainer [2025-02-06 08:57:50,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:57:50,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:57:50,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:57:50,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:57:50,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:57:50" (1/3) ... [2025-02-06 08:57:50,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a780b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:57:50, skipping insertion in model container [2025-02-06 08:57:50,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:57:50" (2/3) ... [2025-02-06 08:57:50,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a780b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:57:50, skipping insertion in model container [2025-02-06 08:57:50,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:57:50" (3/3) ... [2025-02-06 08:57:50,952 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-1b.i [2025-02-06 08:57:50,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:57:50,963 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-02-06 08:57:50,963 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 08:57:51,014 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 08:57:51,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 147 transitions, 322 flow [2025-02-06 08:57:51,083 INFO L124 PetriNetUnfolderBase]: 4/143 cut-off events. [2025-02-06 08:57:51,085 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 08:57:51,090 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-02-06 08:57:51,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 147 transitions, 322 flow [2025-02-06 08:57:51,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 138 transitions, 297 flow [2025-02-06 08:57:51,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:57:51,109 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;@3e614aa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:57:51,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-06 08:57:51,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:57:51,122 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2025-02-06 08:57:51,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:57:51,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:51,123 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-02-06 08:57:51,123 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-02-06 08:57:51,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1947153176, now seen corresponding path program 1 times [2025-02-06 08:57:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392385420] [2025-02-06 08:57:51,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:51,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 08:57:51,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 08:57:51,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:51,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:51,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392385420] [2025-02-06 08:57:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392385420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:57:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102852429] [2025-02-06 08:57:51,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:51,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:51,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:51,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:51,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:57:51,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 147 [2025-02-06 08:57:51,418 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-02-06 08:57:51,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:51,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 147 [2025-02-06 08:57:51,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:52,441 INFO L124 PetriNetUnfolderBase]: 2982/7601 cut-off events. [2025-02-06 08:57:52,441 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-02-06 08:57:52,474 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-02-06 08:57:52,568 INFO L140 encePairwiseOnDemand]: 134/147 looper letters, 33 selfloop transitions, 8 changer transitions 0/148 dead transitions. [2025-02-06 08:57:52,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 148 transitions, 408 flow [2025-02-06 08:57:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2025-02-06 08:57:52,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909297052154195 [2025-02-06 08:57:52,590 INFO L175 Difference]: Start difference. First operand has 147 places, 138 transitions, 297 flow. Second operand 3 states and 401 transitions. [2025-02-06 08:57:52,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 148 transitions, 408 flow [2025-02-06 08:57:52,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 148 transitions, 390 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 08:57:52,605 INFO L231 Difference]: Finished difference. Result has 142 places, 139 transitions, 334 flow [2025-02-06 08:57:52,608 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-02-06 08:57:52,611 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -5 predicate places. [2025-02-06 08:57:52,611 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 139 transitions, 334 flow [2025-02-06 08:57:52,612 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-02-06 08:57:52,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:52,613 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-02-06 08:57:52,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:57:52,613 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-02-06 08:57:52,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1152894252, now seen corresponding path program 1 times [2025-02-06 08:57:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:52,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628412517] [2025-02-06 08:57:52,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:52,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:52,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 08:57:52,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 08:57:52,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:52,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628412517] [2025-02-06 08:57:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628412517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:52,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:52,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:57:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104789250] [2025-02-06 08:57:52,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:52,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:52,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:52,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:57:52,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 147 [2025-02-06 08:57:52,705 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-02-06 08:57:52,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:52,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 147 [2025-02-06 08:57:52,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:55,295 INFO L124 PetriNetUnfolderBase]: 9490/25323 cut-off events. [2025-02-06 08:57:55,295 INFO L125 PetriNetUnfolderBase]: For 6356/7074 co-relation queries the response was YES. [2025-02-06 08:57:55,353 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-02-06 08:57:55,456 INFO L140 encePairwiseOnDemand]: 133/147 looper letters, 47 selfloop transitions, 15 changer transitions 0/167 dead transitions. [2025-02-06 08:57:55,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 167 transitions, 554 flow [2025-02-06 08:57:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-02-06 08:57:55,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956916099773242 [2025-02-06 08:57:55,459 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 334 flow. Second operand 3 states and 395 transitions. [2025-02-06 08:57:55,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 167 transitions, 554 flow [2025-02-06 08:57:55,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 167 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:57:55,499 INFO L231 Difference]: Finished difference. Result has 144 places, 154 transitions, 468 flow [2025-02-06 08:57:55,499 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-02-06 08:57:55,500 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -3 predicate places. [2025-02-06 08:57:55,500 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 154 transitions, 468 flow [2025-02-06 08:57:55,501 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-02-06 08:57:55,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:55,501 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-02-06 08:57:55,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:57:55,501 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-02-06 08:57:55,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash -333280466, now seen corresponding path program 1 times [2025-02-06 08:57:55,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:55,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291558747] [2025-02-06 08:57:55,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:55,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 08:57:55,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 08:57:55,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:55,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:55,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291558747] [2025-02-06 08:57:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291558747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:55,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:55,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:57:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931930607] [2025-02-06 08:57:55,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:55,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:55,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:57:55,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 147 [2025-02-06 08:57:55,641 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-02-06 08:57:55,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:55,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 147 [2025-02-06 08:57:55,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:58,181 INFO L124 PetriNetUnfolderBase]: 10517/30535 cut-off events. [2025-02-06 08:57:58,181 INFO L125 PetriNetUnfolderBase]: For 7995/10010 co-relation queries the response was YES. [2025-02-06 08:57:58,279 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-02-06 08:57:58,407 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 31 selfloop transitions, 5 changer transitions 0/167 dead transitions. [2025-02-06 08:57:58,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 167 transitions, 570 flow [2025-02-06 08:57:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2025-02-06 08:57:58,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8934240362811792 [2025-02-06 08:57:58,411 INFO L175 Difference]: Start difference. First operand has 144 places, 154 transitions, 468 flow. Second operand 3 states and 394 transitions. [2025-02-06 08:57:58,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 167 transitions, 570 flow [2025-02-06 08:57:58,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 167 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:57:58,427 INFO L231 Difference]: Finished difference. Result has 146 places, 158 transitions, 476 flow [2025-02-06 08:57:58,428 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-02-06 08:57:58,428 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -1 predicate places. [2025-02-06 08:57:58,429 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 158 transitions, 476 flow [2025-02-06 08:57:58,429 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-02-06 08:57:58,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:58,429 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-02-06 08:57:58,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:57:58,429 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-02-06 08:57:58,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1548379573, now seen corresponding path program 1 times [2025-02-06 08:57:58,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:58,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281202881] [2025-02-06 08:57:58,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:58,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:58,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 08:57:58,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 08:57:58,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:58,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:58,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:58,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281202881] [2025-02-06 08:57:58,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281202881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:58,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:57:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672873008] [2025-02-06 08:57:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:58,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:58,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:58,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:58,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:57:58,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 147 [2025-02-06 08:57:58,568 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-02-06 08:57:58,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:58,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 147 [2025-02-06 08:57:58,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:58,718 INFO L124 PetriNetUnfolderBase]: 590/2985 cut-off events. [2025-02-06 08:57:58,719 INFO L125 PetriNetUnfolderBase]: For 571/856 co-relation queries the response was YES. [2025-02-06 08:57:58,726 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-02-06 08:57:58,733 INFO L140 encePairwiseOnDemand]: 139/147 looper letters, 10 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2025-02-06 08:57:58,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 142 transitions, 465 flow [2025-02-06 08:57:58,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2025-02-06 08:57:58,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9024943310657596 [2025-02-06 08:57:58,735 INFO L175 Difference]: Start difference. First operand has 146 places, 158 transitions, 476 flow. Second operand 3 states and 398 transitions. [2025-02-06 08:57:58,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 142 transitions, 465 flow [2025-02-06 08:57:58,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 142 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:57:58,740 INFO L231 Difference]: Finished difference. Result has 128 places, 139 transitions, 433 flow [2025-02-06 08:57:58,741 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-02-06 08:57:58,742 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -19 predicate places. [2025-02-06 08:57:58,742 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 139 transitions, 433 flow [2025-02-06 08:57:58,743 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-02-06 08:57:58,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:58,743 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-02-06 08:57:58,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:57:58,743 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-02-06 08:57:58,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2058137397, now seen corresponding path program 2 times [2025-02-06 08:57:58,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:58,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665143503] [2025-02-06 08:57:58,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:57:58,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:58,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-02-06 08:57:58,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 08:57:58,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:57:58,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:58,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:58,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665143503] [2025-02-06 08:57:58,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665143503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:58,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:58,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:57:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658152321] [2025-02-06 08:57:58,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:58,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:58,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:58,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:57:58,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 147 [2025-02-06 08:57:58,955 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-02-06 08:57:58,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:58,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 147 [2025-02-06 08:57:58,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:58,982 INFO L124 PetriNetUnfolderBase]: 34/326 cut-off events. [2025-02-06 08:57:58,983 INFO L125 PetriNetUnfolderBase]: For 45/54 co-relation queries the response was YES. [2025-02-06 08:57:58,983 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-02-06 08:57:58,984 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 10 selfloop transitions, 1 changer transitions 11/119 dead transitions. [2025-02-06 08:57:58,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 355 flow [2025-02-06 08:57:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2025-02-06 08:57:58,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-02-06 08:57:58,985 INFO L175 Difference]: Start difference. First operand has 128 places, 139 transitions, 433 flow. Second operand 3 states and 392 transitions. [2025-02-06 08:57:58,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 355 flow [2025-02-06 08:57:58,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 119 transitions, 337 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-02-06 08:57:58,988 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 283 flow [2025-02-06 08:57:58,988 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-02-06 08:57:58,989 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -22 predicate places. [2025-02-06 08:57:58,989 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 283 flow [2025-02-06 08:57:58,989 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-02-06 08:57:58,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:58,989 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-02-06 08:57:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:57:58,989 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-02-06 08:57:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1206253176, now seen corresponding path program 1 times [2025-02-06 08:57:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:58,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924916963] [2025-02-06 08:57:58,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:58,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:58,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 08:57:58,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 08:57:59,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:59,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:59,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:59,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924916963] [2025-02-06 08:57:59,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924916963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:59,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:59,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:57:59,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308230665] [2025-02-06 08:57:59,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:59,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:59,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:59,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:59,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:57:59,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 147 [2025-02-06 08:57:59,153 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-02-06 08:57:59,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:59,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 147 [2025-02-06 08:57:59,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:59,193 INFO L124 PetriNetUnfolderBase]: 52/394 cut-off events. [2025-02-06 08:57:59,193 INFO L125 PetriNetUnfolderBase]: For 73/78 co-relation queries the response was YES. [2025-02-06 08:57:59,194 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-02-06 08:57:59,195 INFO L140 encePairwiseOnDemand]: 139/147 looper letters, 20 selfloop transitions, 6 changer transitions 3/117 dead transitions. [2025-02-06 08:57:59,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 378 flow [2025-02-06 08:57:59,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2025-02-06 08:57:59,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8707482993197279 [2025-02-06 08:57:59,199 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 283 flow. Second operand 3 states and 384 transitions. [2025-02-06 08:57:59,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 378 flow [2025-02-06 08:57:59,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 373 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 08:57:59,201 INFO L231 Difference]: Finished difference. Result has 118 places, 110 transitions, 324 flow [2025-02-06 08:57:59,201 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-02-06 08:57:59,202 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -29 predicate places. [2025-02-06 08:57:59,202 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 324 flow [2025-02-06 08:57:59,202 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-02-06 08:57:59,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:59,202 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-02-06 08:57:59,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:57:59,202 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-02-06 08:57:59,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:59,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2089505491, now seen corresponding path program 1 times [2025-02-06 08:57:59,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:59,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466285262] [2025-02-06 08:57:59,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:59,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:59,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 08:57:59,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 08:57:59,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:59,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466285262] [2025-02-06 08:57:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466285262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:59,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:59,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:57:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272463678] [2025-02-06 08:57:59,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:59,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:59,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:59,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:59,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:57:59,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 147 [2025-02-06 08:57:59,274 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-02-06 08:57:59,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:59,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 147 [2025-02-06 08:57:59,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:59,312 INFO L124 PetriNetUnfolderBase]: 43/368 cut-off events. [2025-02-06 08:57:59,312 INFO L125 PetriNetUnfolderBase]: For 130/131 co-relation queries the response was YES. [2025-02-06 08:57:59,313 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-02-06 08:57:59,313 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 14 selfloop transitions, 0 changer transitions 6/110 dead transitions. [2025-02-06 08:57:59,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 110 transitions, 362 flow [2025-02-06 08:57:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:59,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2025-02-06 08:57:59,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8299319727891157 [2025-02-06 08:57:59,315 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 324 flow. Second operand 3 states and 366 transitions. [2025-02-06 08:57:59,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 110 transitions, 362 flow [2025-02-06 08:57:59,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 110 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 08:57:59,317 INFO L231 Difference]: Finished difference. Result has 117 places, 104 transitions, 295 flow [2025-02-06 08:57:59,317 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-02-06 08:57:59,318 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -30 predicate places. [2025-02-06 08:57:59,318 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 104 transitions, 295 flow [2025-02-06 08:57:59,318 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-02-06 08:57:59,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:59,318 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-02-06 08:57:59,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:57:59,320 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-02-06 08:57:59,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:59,321 INFO L85 PathProgramCache]: Analyzing trace with hash -421305579, now seen corresponding path program 1 times [2025-02-06 08:57:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:59,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841189905] [2025-02-06 08:57:59,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:59,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:59,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 08:57:59,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 08:57:59,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:59,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:57:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:57:59,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:57:59,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841189905] [2025-02-06 08:57:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841189905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:57:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:57:59,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:57:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39278184] [2025-02-06 08:57:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:57:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:57:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:57:59,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:57:59,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:57:59,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 147 [2025-02-06 08:57:59,381 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-02-06 08:57:59,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:57:59,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 147 [2025-02-06 08:57:59,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:57:59,414 INFO L124 PetriNetUnfolderBase]: 55/403 cut-off events. [2025-02-06 08:57:59,414 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-02-06 08:57:59,415 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-02-06 08:57:59,416 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 18 selfloop transitions, 7 changer transitions 1/109 dead transitions. [2025-02-06 08:57:59,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 109 transitions, 365 flow [2025-02-06 08:57:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:57:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:57:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-02-06 08:57:59,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854875283446712 [2025-02-06 08:57:59,418 INFO L175 Difference]: Start difference. First operand has 117 places, 104 transitions, 295 flow. Second operand 3 states and 377 transitions. [2025-02-06 08:57:59,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 109 transitions, 365 flow [2025-02-06 08:57:59,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 109 transitions, 359 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 08:57:59,421 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 339 flow [2025-02-06 08:57:59,421 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-02-06 08:57:59,422 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, -34 predicate places. [2025-02-06 08:57:59,422 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 339 flow [2025-02-06 08:57:59,422 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-02-06 08:57:59,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:57:59,422 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-02-06 08:57:59,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:57:59,422 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-02-06 08:57:59,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:57:59,423 INFO L85 PathProgramCache]: Analyzing trace with hash 917382501, now seen corresponding path program 1 times [2025-02-06 08:57:59,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:57:59,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487755875] [2025-02-06 08:57:59,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:57:59,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:57:59,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 08:57:59,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 08:57:59,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:59,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:57:59,436 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:57:59,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 08:57:59,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 08:57:59,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:57:59,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:57:59,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:57:59,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:57:59,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr2ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2025-02-06 08:57:59,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr2ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-02-06 08:57:59,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr3ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-02-06 08:57:59,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr1ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-02-06 08:57:59,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-02-06 08:57:59,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-02-06 08:57:59,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location writerErr0ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-02-06 08:57:59,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:57:59,492 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:57:59,530 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 08:57:59,533 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 08:57:59,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 08:57:59 BasicIcfg [2025-02-06 08:57:59,542 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 08:57:59,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 08:57:59,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 08:57:59,543 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 08:57:59,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:57:50" (3/4) ... [2025-02-06 08:57:59,546 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 08:57:59,588 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-02-06 08:57:59,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 08:57:59,629 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 08:57:59,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 08:57:59,633 INFO L158 Benchmark]: Toolchain (without parser) took 9429.21ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 112.8MB in the beginning and 440.4MB in the end (delta: -327.6MB). Peak memory consumption was 350.6MB. Max. memory is 16.1GB. [2025-02-06 08:57:59,634 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 08:57:59,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.04ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 92.9MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 08:57:59,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.42ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 08:57:59,634 INFO L158 Benchmark]: Boogie Preprocessor took 31.94ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.6MB in the end (delta: 999.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 08:57:59,634 INFO L158 Benchmark]: IcfgBuilder took 359.51ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 75.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 08:57:59,635 INFO L158 Benchmark]: TraceAbstraction took 8596.37ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 74.7MB in the beginning and 453.0MB in the end (delta: -378.3MB). Peak memory consumption was 300.3MB. Max. memory is 16.1GB. [2025-02-06 08:57:59,635 INFO L158 Benchmark]: Witness Printer took 89.93ms. Allocated memory is still 822.1MB. Free memory was 453.0MB in the beginning and 440.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 08:57:59,636 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.52ms. Allocated memory is still 201.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.04ms. Allocated memory is still 142.6MB. Free memory was 112.8MB in the beginning and 92.9MB in the end (delta: 19.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.42ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.94ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.6MB in the end (delta: 999.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 359.51ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 75.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8596.37ms. Allocated memory was 142.6MB in the beginning and 822.1MB in the end (delta: 679.5MB). Free memory was 74.7MB in the beginning and 453.0MB in the end (delta: -378.3MB). Peak memory consumption was 300.3MB. Max. memory is 16.1GB. * Witness Printer took 89.93ms. Allocated memory is still 822.1MB. Free memory was 453.0MB in the beginning and 440.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. 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: 8.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.4s 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.6s 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-02-06 08:57:59,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)