./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/ring_1w1r-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-divine/ring_1w1r-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a956b76a4ba98ce13df4d83ef2fb7ffa0973225ecb152c14bcfbb55b6546601 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:33:43,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:33:43,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:33:43,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:33:43,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:33:43,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:33:43,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:33:43,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:33:43,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:33:43,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:33:43,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:33:43,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:33:43,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:33:43,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:33:43,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:33:43,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:33:43,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:33:43,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:33:43,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:33:43,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:33:43,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:33:43,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:33:43,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:33:43,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:33:43,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:33:43,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:33:43,327 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a956b76a4ba98ce13df4d83ef2fb7ffa0973225ecb152c14bcfbb55b6546601 [2025-03-14 01:33:43,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:33:43,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:33:43,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:33:43,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:33:43,594 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:33:43,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_1w1r-1.i [2025-03-14 01:33:44,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052828845/e2b8b1b4e9d441cea98bfdb622c3f680/FLAGb6167001a [2025-03-14 01:33:45,019 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:33:45,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_1w1r-1.i [2025-03-14 01:33:45,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052828845/e2b8b1b4e9d441cea98bfdb622c3f680/FLAGb6167001a [2025-03-14 01:33:45,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052828845/e2b8b1b4e9d441cea98bfdb622c3f680 [2025-03-14 01:33:45,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:33:45,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:33:45,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:33:45,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:33:45,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:33:45,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b68cf87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45, skipping insertion in model container [2025-03-14 01:33:45,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:33:45,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:33:45,670 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:33:45,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:33:45,753 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:33:45,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45 WrapperNode [2025-03-14 01:33:45,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:33:45,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:33:45,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:33:45,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:33:45,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,788 INFO L138 Inliner]: procedures = 224, calls = 44, calls flagged for inlining = 16, calls inlined = 10, statements flattened = 190 [2025-03-14 01:33:45,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:33:45,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:33:45,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:33:45,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:33:45,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:33:45,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:33:45,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:33:45,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:33:45,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (1/1) ... [2025-03-14 01:33:45,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:33:45,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:33:45,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:33:45,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:33:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:33:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:33:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:33:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:33:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:33:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:33:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure reader_nowait_fn [2025-03-14 01:33:45,871 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_nowait_fn [2025-03-14 01:33:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:33:45,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:33:45,873 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:33:45,972 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:33:45,973 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:33:46,134 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc ring_empty_#t~mem15#1; [2025-03-14 01:33:46,134 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-1: havoc ring_empty_#t~mem14#1; [2025-03-14 01:33:46,283 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:33:46,284 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:33:46,284 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:33:46,300 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:33:46,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:33:46 BoogieIcfgContainer [2025-03-14 01:33:46,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:33:46,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:33:46,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:33:46,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:33:46,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:33:45" (1/3) ... [2025-03-14 01:33:46,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aeb5987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:33:46, skipping insertion in model container [2025-03-14 01:33:46,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:33:45" (2/3) ... [2025-03-14 01:33:46,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aeb5987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:33:46, skipping insertion in model container [2025-03-14 01:33:46,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:33:46" (3/3) ... [2025-03-14 01:33:46,308 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_1w1r-1.i [2025-03-14 01:33:46,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:33:46,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ring_1w1r-1.i that has 2 procedures, 226 locations, 1 initial locations, 3 loop locations, and 14 error locations. [2025-03-14 01:33:46,322 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:33:46,399 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:33:46,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 235 transitions, 477 flow [2025-03-14 01:33:46,509 INFO L124 PetriNetUnfolderBase]: 10/234 cut-off events. [2025-03-14 01:33:46,512 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:33:46,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 234 events. 10/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 537 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 184. Up to 2 conditions per place. [2025-03-14 01:33:46,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 235 transitions, 477 flow [2025-03-14 01:33:46,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 228 transitions, 459 flow [2025-03-14 01:33:46,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:33:46,560 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;@7927a371, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:33:46,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-14 01:33:46,572 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:33:46,572 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-14 01:33:46,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:33:46,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:46,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:46,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:33:46,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash 901856057, now seen corresponding path program 1 times [2025-03-14 01:33:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478723659] [2025-03-14 01:33:46,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:46,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:33:46,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:33:46,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:46,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:47,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:47,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478723659] [2025-03-14 01:33:47,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478723659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:47,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:47,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:47,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624638413] [2025-03-14 01:33:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:47,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:47,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:47,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:47,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:47,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 235 [2025-03-14 01:33:47,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 228 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:47,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:47,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 235 [2025-03-14 01:33:47,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:47,883 INFO L124 PetriNetUnfolderBase]: 675/3079 cut-off events. [2025-03-14 01:33:47,884 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:33:47,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 3079 events. 675/3079 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 24220 event pairs, 576 based on Foata normal form. 206/2979 useless extension candidates. Maximal degree in co-relation 4315. Up to 1286 conditions per place. [2025-03-14 01:33:47,904 INFO L140 encePairwiseOnDemand]: 222/235 looper letters, 54 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-03-14 01:33:47,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 217 transitions, 555 flow [2025-03-14 01:33:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1069 transitions. [2025-03-14 01:33:47,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7581560283687944 [2025-03-14 01:33:47,939 INFO L175 Difference]: Start difference. First operand has 222 places, 228 transitions, 459 flow. Second operand 6 states and 1069 transitions. [2025-03-14 01:33:47,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 217 transitions, 555 flow [2025-03-14 01:33:47,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 217 transitions, 554 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:33:47,948 INFO L231 Difference]: Finished difference. Result has 222 places, 217 transitions, 446 flow [2025-03-14 01:33:47,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=222, PETRI_TRANSITIONS=217} [2025-03-14 01:33:47,953 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 0 predicate places. [2025-03-14 01:33:47,954 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 217 transitions, 446 flow [2025-03-14 01:33:47,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:47,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:47,955 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] [2025-03-14 01:33:47,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:33:47,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:33:47,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1141984178, now seen corresponding path program 1 times [2025-03-14 01:33:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:47,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358358300] [2025-03-14 01:33:47,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:47,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:47,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:33:47,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:33:47,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:47,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:48,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358358300] [2025-03-14 01:33:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358358300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:48,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255777092] [2025-03-14 01:33:48,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:48,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:48,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:48,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:48,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 235 [2025-03-14 01:33:48,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 217 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:48,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:48,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 235 [2025-03-14 01:33:48,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:48,752 INFO L124 PetriNetUnfolderBase]: 675/3078 cut-off events. [2025-03-14 01:33:48,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:33:48,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4378 conditions, 3078 events. 675/3078 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 24315 event pairs, 576 based on Foata normal form. 0/2773 useless extension candidates. Maximal degree in co-relation 4327. Up to 1286 conditions per place. [2025-03-14 01:33:48,765 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 54 selfloop transitions, 5 changer transitions 0/216 dead transitions. [2025-03-14 01:33:48,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 216 transitions, 562 flow [2025-03-14 01:33:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1062 transitions. [2025-03-14 01:33:48,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7531914893617021 [2025-03-14 01:33:48,769 INFO L175 Difference]: Start difference. First operand has 222 places, 217 transitions, 446 flow. Second operand 6 states and 1062 transitions. [2025-03-14 01:33:48,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 216 transitions, 562 flow [2025-03-14 01:33:48,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 216 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:33:48,775 INFO L231 Difference]: Finished difference. Result has 221 places, 216 transitions, 444 flow [2025-03-14 01:33:48,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=221, PETRI_TRANSITIONS=216} [2025-03-14 01:33:48,777 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, -1 predicate places. [2025-03-14 01:33:48,777 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 216 transitions, 444 flow [2025-03-14 01:33:48,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:48,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:48,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:48,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:33:48,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:33:48,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1467489712, now seen corresponding path program 1 times [2025-03-14 01:33:48,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:48,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084263090] [2025-03-14 01:33:48,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:48,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:48,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-14 01:33:48,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-14 01:33:48,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:48,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:49,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:49,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084263090] [2025-03-14 01:33:49,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084263090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:49,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:49,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119437342] [2025-03-14 01:33:49,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:49,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:49,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:49,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:49,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:49,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 235 [2025-03-14 01:33:49,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 216 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 192.66666666666666) internal successors, (1156), 6 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:49,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:49,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 235 [2025-03-14 01:33:49,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:49,630 INFO L124 PetriNetUnfolderBase]: 311/2118 cut-off events. [2025-03-14 01:33:49,630 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:33:49,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 2118 events. 311/2118 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 14685 event pairs, 64 based on Foata normal form. 0/1898 useless extension candidates. Maximal degree in co-relation 2665. Up to 452 conditions per place. [2025-03-14 01:33:49,641 INFO L140 encePairwiseOnDemand]: 214/235 looper letters, 39 selfloop transitions, 43 changer transitions 0/261 dead transitions. [2025-03-14 01:33:49,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 261 transitions, 698 flow [2025-03-14 01:33:49,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2025-03-14 01:33:49,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8680851063829788 [2025-03-14 01:33:49,646 INFO L175 Difference]: Start difference. First operand has 221 places, 216 transitions, 444 flow. Second operand 6 states and 1224 transitions. [2025-03-14 01:33:49,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 261 transitions, 698 flow [2025-03-14 01:33:49,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 261 transitions, 688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:33:49,654 INFO L231 Difference]: Finished difference. Result has 226 places, 258 transitions, 730 flow [2025-03-14 01:33:49,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=730, PETRI_PLACES=226, PETRI_TRANSITIONS=258} [2025-03-14 01:33:49,655 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 4 predicate places. [2025-03-14 01:33:49,655 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 258 transitions, 730 flow [2025-03-14 01:33:49,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.66666666666666) internal successors, (1156), 6 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:49,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:49,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:49,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:33:49,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:33:49,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:49,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1382232564, now seen corresponding path program 1 times [2025-03-14 01:33:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:49,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824658063] [2025-03-14 01:33:49,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:49,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:49,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-14 01:33:49,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-14 01:33:49,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:49,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:33:49,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824658063] [2025-03-14 01:33:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824658063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:49,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:49,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:33:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978255489] [2025-03-14 01:33:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:49,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:33:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:49,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:33:49,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:33:49,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 235 [2025-03-14 01:33:49,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 258 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:49,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:49,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 235 [2025-03-14 01:33:49,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:49,897 INFO L124 PetriNetUnfolderBase]: 297/2369 cut-off events. [2025-03-14 01:33:49,897 INFO L125 PetriNetUnfolderBase]: For 238/272 co-relation queries the response was YES. [2025-03-14 01:33:49,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 2369 events. 297/2369 cut-off events. For 238/272 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 16879 event pairs, 16 based on Foata normal form. 1/2172 useless extension candidates. Maximal degree in co-relation 3412. Up to 342 conditions per place. [2025-03-14 01:33:49,907 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 3 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2025-03-14 01:33:49,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 259 transitions, 742 flow [2025-03-14 01:33:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:33:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:33:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2025-03-14 01:33:49,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9574468085106383 [2025-03-14 01:33:49,909 INFO L175 Difference]: Start difference. First operand has 226 places, 258 transitions, 730 flow. Second operand 3 states and 675 transitions. [2025-03-14 01:33:49,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 259 transitions, 742 flow [2025-03-14 01:33:49,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 259 transitions, 742 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:33:49,914 INFO L231 Difference]: Finished difference. Result has 229 places, 259 transitions, 742 flow [2025-03-14 01:33:49,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=229, PETRI_TRANSITIONS=259} [2025-03-14 01:33:49,915 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 7 predicate places. [2025-03-14 01:33:49,915 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 259 transitions, 742 flow [2025-03-14 01:33:49,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:49,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:49,916 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] [2025-03-14 01:33:49,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:33:49,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:33:49,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash -375678616, now seen corresponding path program 1 times [2025-03-14 01:33:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587256995] [2025-03-14 01:33:49,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:49,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-14 01:33:49,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-14 01:33:49,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:49,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:33:50,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:50,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587256995] [2025-03-14 01:33:50,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587256995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:50,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626423649] [2025-03-14 01:33:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:50,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:50,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:50,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:50,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:50,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 235 [2025-03-14 01:33:50,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 259 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 186.66666666666666) internal successors, (1120), 6 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:50,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:50,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 235 [2025-03-14 01:33:50,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:51,112 INFO L124 PetriNetUnfolderBase]: 780/4989 cut-off events. [2025-03-14 01:33:51,112 INFO L125 PetriNetUnfolderBase]: For 952/1119 co-relation queries the response was YES. [2025-03-14 01:33:51,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8236 conditions, 4989 events. 780/4989 cut-off events. For 952/1119 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 43668 event pairs, 132 based on Foata normal form. 68/4724 useless extension candidates. Maximal degree in co-relation 8174. Up to 1061 conditions per place. [2025-03-14 01:33:51,134 INFO L140 encePairwiseOnDemand]: 211/235 looper letters, 81 selfloop transitions, 45 changer transitions 0/309 dead transitions. [2025-03-14 01:33:51,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 309 transitions, 1154 flow [2025-03-14 01:33:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1188 transitions. [2025-03-14 01:33:51,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425531914893617 [2025-03-14 01:33:51,137 INFO L175 Difference]: Start difference. First operand has 229 places, 259 transitions, 742 flow. Second operand 6 states and 1188 transitions. [2025-03-14 01:33:51,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 309 transitions, 1154 flow [2025-03-14 01:33:51,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 309 transitions, 1152 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:33:51,143 INFO L231 Difference]: Finished difference. Result has 238 places, 303 transitions, 1132 flow [2025-03-14 01:33:51,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1132, PETRI_PLACES=238, PETRI_TRANSITIONS=303} [2025-03-14 01:33:51,144 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 16 predicate places. [2025-03-14 01:33:51,145 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 303 transitions, 1132 flow [2025-03-14 01:33:51,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.66666666666666) internal successors, (1120), 6 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:51,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:51,145 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] [2025-03-14 01:33:51,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:33:51,146 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:33:51,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash -120649481, now seen corresponding path program 1 times [2025-03-14 01:33:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005124097] [2025-03-14 01:33:51,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:51,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-14 01:33:51,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-14 01:33:51,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:51,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:51,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:33:51,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:51,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005124097] [2025-03-14 01:33:51,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005124097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:51,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:51,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567806452] [2025-03-14 01:33:51,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:51,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:51,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:51,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:51,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:51,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 235 [2025-03-14 01:33:51,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 303 transitions, 1132 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:51,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:51,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 235 [2025-03-14 01:33:51,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:52,564 INFO L124 PetriNetUnfolderBase]: 1088/6751 cut-off events. [2025-03-14 01:33:52,565 INFO L125 PetriNetUnfolderBase]: For 5263/6169 co-relation queries the response was YES. [2025-03-14 01:33:52,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13076 conditions, 6751 events. 1088/6751 cut-off events. For 5263/6169 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 63332 event pairs, 142 based on Foata normal form. 185/6494 useless extension candidates. Maximal degree in co-relation 13010. Up to 1440 conditions per place. [2025-03-14 01:33:52,595 INFO L140 encePairwiseOnDemand]: 220/235 looper letters, 94 selfloop transitions, 78 changer transitions 0/380 dead transitions. [2025-03-14 01:33:52,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 380 transitions, 1934 flow [2025-03-14 01:33:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1240 transitions. [2025-03-14 01:33:52,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-14 01:33:52,598 INFO L175 Difference]: Start difference. First operand has 238 places, 303 transitions, 1132 flow. Second operand 6 states and 1240 transitions. [2025-03-14 01:33:52,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 380 transitions, 1934 flow [2025-03-14 01:33:52,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 380 transitions, 1934 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:33:52,612 INFO L231 Difference]: Finished difference. Result has 248 places, 380 transitions, 1950 flow [2025-03-14 01:33:52,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1950, PETRI_PLACES=248, PETRI_TRANSITIONS=380} [2025-03-14 01:33:52,613 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 26 predicate places. [2025-03-14 01:33:52,613 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 380 transitions, 1950 flow [2025-03-14 01:33:52,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:52,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:52,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:52,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:33:52,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:33:52,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1833409638, now seen corresponding path program 1 times [2025-03-14 01:33:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:52,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848056990] [2025-03-14 01:33:52,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:52,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:52,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-14 01:33:52,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-14 01:33:52,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:52,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:33:52,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:52,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848056990] [2025-03-14 01:33:52,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848056990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:52,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:52,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:52,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094170517] [2025-03-14 01:33:52,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:52,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:52,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:52,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:52,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:53,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 235 [2025-03-14 01:33:53,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 380 transitions, 1950 flow. Second operand has 6 states, 6 states have (on average 203.66666666666666) internal successors, (1222), 6 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:53,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:53,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 235 [2025-03-14 01:33:53,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:54,108 INFO L124 PetriNetUnfolderBase]: 1203/7402 cut-off events. [2025-03-14 01:33:54,109 INFO L125 PetriNetUnfolderBase]: For 5984/6524 co-relation queries the response was YES. [2025-03-14 01:33:54,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15220 conditions, 7402 events. 1203/7402 cut-off events. For 5984/6524 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 70763 event pairs, 87 based on Foata normal form. 186/7174 useless extension candidates. Maximal degree in co-relation 15149. Up to 1093 conditions per place. [2025-03-14 01:33:54,143 INFO L140 encePairwiseOnDemand]: 224/235 looper letters, 103 selfloop transitions, 66 changer transitions 0/445 dead transitions. [2025-03-14 01:33:54,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 445 transitions, 2720 flow [2025-03-14 01:33:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1258 transitions. [2025-03-14 01:33:54,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8921985815602836 [2025-03-14 01:33:54,147 INFO L175 Difference]: Start difference. First operand has 248 places, 380 transitions, 1950 flow. Second operand 6 states and 1258 transitions. [2025-03-14 01:33:54,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 445 transitions, 2720 flow [2025-03-14 01:33:54,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 445 transitions, 2720 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:33:54,165 INFO L231 Difference]: Finished difference. Result has 258 places, 442 transitions, 2712 flow [2025-03-14 01:33:54,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2712, PETRI_PLACES=258, PETRI_TRANSITIONS=442} [2025-03-14 01:33:54,167 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 36 predicate places. [2025-03-14 01:33:54,167 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 442 transitions, 2712 flow [2025-03-14 01:33:54,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.66666666666666) internal successors, (1222), 6 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:54,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:54,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:54,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:33:54,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reader_nowait_fnErr2ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:33:54,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1503671530, now seen corresponding path program 1 times [2025-03-14 01:33:54,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:54,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112509300] [2025-03-14 01:33:54,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:54,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:54,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-14 01:33:54,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-14 01:33:54,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:54,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:33:54,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:54,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112509300] [2025-03-14 01:33:54,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112509300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:54,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:54,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:54,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270779590] [2025-03-14 01:33:54,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:54,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:54,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:54,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:54,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:54,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 235 [2025-03-14 01:33:54,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 442 transitions, 2712 flow. Second operand has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:54,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:54,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 235 [2025-03-14 01:33:54,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:56,765 INFO L124 PetriNetUnfolderBase]: 5261/16665 cut-off events. [2025-03-14 01:33:56,765 INFO L125 PetriNetUnfolderBase]: For 19061/19361 co-relation queries the response was YES. [2025-03-14 01:33:56,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44613 conditions, 16665 events. 5261/16665 cut-off events. For 19061/19361 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 158437 event pairs, 2287 based on Foata normal form. 50/15799 useless extension candidates. Maximal degree in co-relation 44537. Up to 9666 conditions per place. [2025-03-14 01:33:56,966 INFO L140 encePairwiseOnDemand]: 204/235 looper letters, 260 selfloop transitions, 156 changer transitions 0/573 dead transitions. [2025-03-14 01:33:56,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 573 transitions, 4280 flow [2025-03-14 01:33:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:33:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:33:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1134 transitions. [2025-03-14 01:33:56,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8042553191489362 [2025-03-14 01:33:56,970 INFO L175 Difference]: Start difference. First operand has 258 places, 442 transitions, 2712 flow. Second operand 6 states and 1134 transitions. [2025-03-14 01:33:56,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 573 transitions, 4280 flow [2025-03-14 01:33:57,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 573 transitions, 4280 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:33:57,031 INFO L231 Difference]: Finished difference. Result has 268 places, 573 transitions, 4180 flow [2025-03-14 01:33:57,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2712, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4180, PETRI_PLACES=268, PETRI_TRANSITIONS=573} [2025-03-14 01:33:57,036 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 46 predicate places. [2025-03-14 01:33:57,037 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 573 transitions, 4180 flow [2025-03-14 01:33:57,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:57,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:33:57,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:33:57,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:33:57,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:33:57,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:33:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash -661893215, now seen corresponding path program 1 times [2025-03-14 01:33:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:33:57,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835608137] [2025-03-14 01:33:57,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:33:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:33:57,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-14 01:33:57,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-14 01:33:57,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:33:57,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:33:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:33:57,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:33:57,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835608137] [2025-03-14 01:33:57,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835608137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:33:57,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:33:57,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:33:57,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228591605] [2025-03-14 01:33:57,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:33:57,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:33:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:33:57,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:33:57,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:33:57,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 235 [2025-03-14 01:33:57,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 573 transitions, 4180 flow. Second operand has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:33:57,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:33:57,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 235 [2025-03-14 01:33:57,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:33:59,980 INFO L124 PetriNetUnfolderBase]: 5567/17507 cut-off events. [2025-03-14 01:33:59,980 INFO L125 PetriNetUnfolderBase]: For 29098/29352 co-relation queries the response was YES. [2025-03-14 01:34:00,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52930 conditions, 17507 events. 5567/17507 cut-off events. For 29098/29352 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 167720 event pairs, 2232 based on Foata normal form. 12/16658 useless extension candidates. Maximal degree in co-relation 52849. Up to 9984 conditions per place. [2025-03-14 01:34:00,126 INFO L140 encePairwiseOnDemand]: 204/235 looper letters, 372 selfloop transitions, 167 changer transitions 0/700 dead transitions. [2025-03-14 01:34:00,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 700 transitions, 5924 flow [2025-03-14 01:34:00,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:34:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:34:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1134 transitions. [2025-03-14 01:34:00,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8042553191489362 [2025-03-14 01:34:00,129 INFO L175 Difference]: Start difference. First operand has 268 places, 573 transitions, 4180 flow. Second operand 6 states and 1134 transitions. [2025-03-14 01:34:00,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 700 transitions, 5924 flow [2025-03-14 01:34:00,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 700 transitions, 5692 flow, removed 116 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:00,248 INFO L231 Difference]: Finished difference. Result has 278 places, 700 transitions, 5388 flow [2025-03-14 01:34:00,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=3960, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5388, PETRI_PLACES=278, PETRI_TRANSITIONS=700} [2025-03-14 01:34:00,250 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 56 predicate places. [2025-03-14 01:34:00,250 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 700 transitions, 5388 flow [2025-03-14 01:34:00,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:00,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:00,251 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:00,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:34:00,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:34:00,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash 858337806, now seen corresponding path program 1 times [2025-03-14 01:34:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:00,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331716678] [2025-03-14 01:34:00,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:34:00,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:00,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-14 01:34:00,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:34:00,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:34:00,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:34:02,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:02,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331716678] [2025-03-14 01:34:02,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331716678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:02,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:02,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-14 01:34:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837876368] [2025-03-14 01:34:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:02,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 01:34:02,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:02,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 01:34:02,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-03-14 01:34:06,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 235 [2025-03-14 01:34:06,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 700 transitions, 5388 flow. Second operand has 24 states, 24 states have (on average 155.66666666666666) internal successors, (3736), 24 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:06,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:06,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 235 [2025-03-14 01:34:06,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:11,229 INFO L124 PetriNetUnfolderBase]: 6286/25441 cut-off events. [2025-03-14 01:34:11,229 INFO L125 PetriNetUnfolderBase]: For 52755/54255 co-relation queries the response was YES. [2025-03-14 01:34:11,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75290 conditions, 25441 events. 6286/25441 cut-off events. For 52755/54255 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 289034 event pairs, 825 based on Foata normal form. 329/24733 useless extension candidates. Maximal degree in co-relation 75196. Up to 7429 conditions per place. [2025-03-14 01:34:11,443 INFO L140 encePairwiseOnDemand]: 196/235 looper letters, 976 selfloop transitions, 193 changer transitions 0/1447 dead transitions. [2025-03-14 01:34:11,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1447 transitions, 13948 flow [2025-03-14 01:34:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 01:34:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 01:34:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5762 transitions. [2025-03-14 01:34:11,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7005471124620061 [2025-03-14 01:34:11,468 INFO L175 Difference]: Start difference. First operand has 278 places, 700 transitions, 5388 flow. Second operand 35 states and 5762 transitions. [2025-03-14 01:34:11,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 1447 transitions, 13948 flow [2025-03-14 01:34:11,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 1447 transitions, 13792 flow, removed 78 selfloop flow, removed 0 redundant places. [2025-03-14 01:34:11,738 INFO L231 Difference]: Finished difference. Result has 337 places, 901 transitions, 8389 flow [2025-03-14 01:34:11,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5232, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=8389, PETRI_PLACES=337, PETRI_TRANSITIONS=901} [2025-03-14 01:34:11,739 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 115 predicate places. [2025-03-14 01:34:11,739 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 901 transitions, 8389 flow [2025-03-14 01:34:11,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 155.66666666666666) internal successors, (3736), 24 states have internal predecessors, (3736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:11,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:11,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:11,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:34:11,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:34:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1479586550, now seen corresponding path program 2 times [2025-03-14 01:34:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398719440] [2025-03-14 01:34:11,741 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:34:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:11,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:34:11,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 86 of 95 statements. [2025-03-14 01:34:11,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:34:11,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:34:14,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:14,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398719440] [2025-03-14 01:34:14,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398719440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:14,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:14,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 01:34:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53467919] [2025-03-14 01:34:14,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:14,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 01:34:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:14,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 01:34:14,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-14 01:34:17,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 235 [2025-03-14 01:34:17,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 901 transitions, 8389 flow. Second operand has 20 states, 20 states have (on average 162.65) internal successors, (3253), 20 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:17,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:17,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 235 [2025-03-14 01:34:17,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:34:34,070 INFO L124 PetriNetUnfolderBase]: 23454/86484 cut-off events. [2025-03-14 01:34:34,070 INFO L125 PetriNetUnfolderBase]: For 254872/262579 co-relation queries the response was YES. [2025-03-14 01:34:34,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287999 conditions, 86484 events. 23454/86484 cut-off events. For 254872/262579 co-relation queries the response was YES. Maximal size of possible extension queue 1262. Compared 1169615 event pairs, 4115 based on Foata normal form. 1154/84557 useless extension candidates. Maximal degree in co-relation 287878. Up to 12635 conditions per place. [2025-03-14 01:34:35,202 INFO L140 encePairwiseOnDemand]: 194/235 looper letters, 2082 selfloop transitions, 244 changer transitions 0/2618 dead transitions. [2025-03-14 01:34:35,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 2618 transitions, 30225 flow [2025-03-14 01:34:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:34:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:34:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3144 transitions. [2025-03-14 01:34:35,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7869837296620776 [2025-03-14 01:34:35,207 INFO L175 Difference]: Start difference. First operand has 337 places, 901 transitions, 8389 flow. Second operand 17 states and 3144 transitions. [2025-03-14 01:34:35,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 2618 transitions, 30225 flow [2025-03-14 01:34:36,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 2618 transitions, 30184 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-03-14 01:34:36,745 INFO L231 Difference]: Finished difference. Result has 360 places, 1138 transitions, 13118 flow [2025-03-14 01:34:36,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=8348, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=13118, PETRI_PLACES=360, PETRI_TRANSITIONS=1138} [2025-03-14 01:34:36,746 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 138 predicate places. [2025-03-14 01:34:36,746 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 1138 transitions, 13118 flow [2025-03-14 01:34:36,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 162.65) internal successors, (3253), 20 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:36,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:34:36,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:34:36,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:34:36,747 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_nowait_fnErr5ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_nowait_fnErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-14 01:34:36,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:34:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1526421472, now seen corresponding path program 3 times [2025-03-14 01:34:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:34:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673937970] [2025-03-14 01:34:36,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:34:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:34:36,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 2 equivalence classes. [2025-03-14 01:34:36,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 86 of 95 statements. [2025-03-14 01:34:36,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:34:36,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:34:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:34:37,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:34:37,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673937970] [2025-03-14 01:34:37,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673937970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:34:37,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:34:37,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-14 01:34:37,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38473460] [2025-03-14 01:34:37,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:34:37,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:34:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:34:37,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:34:37,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:34:40,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 235 [2025-03-14 01:34:40,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 1138 transitions, 13118 flow. Second operand has 18 states, 18 states have (on average 166.61111111111111) internal successors, (2999), 18 states have internal predecessors, (2999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:34:40,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:34:40,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 235 [2025-03-14 01:34:40,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand