./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-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 f66a662852389d8ac1f64241746e843d67de7f5d7507051fb5c8e68404b785cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:38:12,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:38:12,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:38:12,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:38:12,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:38:12,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:38:12,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:38:12,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:38:12,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:38:12,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:38:12,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:38:12,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:38:12,772 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:38:12,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:38:12,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:38:12,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:38:12,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:38:12,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:38:12,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:38:12,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:38:12,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:38:12,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:38:12,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:38:12,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:38:12,774 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:38:12,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:38:12,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:38:12,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:38:12,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:38:12,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:38:12,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:38:12,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:38:12,775 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 -> f66a662852389d8ac1f64241746e843d67de7f5d7507051fb5c8e68404b785cd [2025-03-08 21:38:13,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:38:13,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:38:13,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:38:13,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:38:13,032 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:38:13,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1.i [2025-03-08 21:38:14,239 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b462399d/08605acef9fd4902acbc8ac2e8107661/FLAGb8951e187 [2025-03-08 21:38:14,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:38:14,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1.i [2025-03-08 21:38:14,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b462399d/08605acef9fd4902acbc8ac2e8107661/FLAGb8951e187 [2025-03-08 21:38:14,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b462399d/08605acef9fd4902acbc8ac2e8107661 [2025-03-08 21:38:14,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:38:14,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:38:14,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:38:14,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:38:14,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:38:14,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:14,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@beba044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14, skipping insertion in model container [2025-03-08 21:38:14,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:14,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:38:14,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:38:14,860 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:38:14,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:38:14,941 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:38:14,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14 WrapperNode [2025-03-08 21:38:14,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:38:14,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:38:14,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:38:14,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:38:14,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:14,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:14,990 INFO L138 Inliner]: procedures = 179, calls = 47, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 954 [2025-03-08 21:38:14,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:38:14,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:38:14,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:38:14,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:38:14,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:14,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:15,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:15,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:15,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:15,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:15,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:15,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:15,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:38:15,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:38:15,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:38:15,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:38:15,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (1/1) ... [2025-03-08 21:38:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:38:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:38:15,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:38:15,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-08 21:38:15,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 21:38:15,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:38:15,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:38:15,092 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:38:15,209 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:38:15,211 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:38:16,112 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:38:16,113 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:38:16,372 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:38:16,372 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:38:16,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:16 BoogieIcfgContainer [2025-03-08 21:38:16,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:38:16,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:38:16,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:38:16,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:38:16,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:38:14" (1/3) ... [2025-03-08 21:38:16,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6b4a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:38:16, skipping insertion in model container [2025-03-08 21:38:16,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:38:14" (2/3) ... [2025-03-08 21:38:16,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6b4a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:38:16, skipping insertion in model container [2025-03-08 21:38:16,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:38:16" (3/3) ... [2025-03-08 21:38:16,381 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2025-03-08 21:38:16,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:38:16,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-1.i that has 2 procedures, 805 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-03-08 21:38:16,393 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:38:16,468 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:38:16,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 808 places, 813 transitions, 1630 flow [2025-03-08 21:38:16,755 INFO L124 PetriNetUnfolderBase]: 8/820 cut-off events. [2025-03-08 21:38:16,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:38:16,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 820 events. 8/820 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 261 event pairs, 0 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 150. Up to 3 conditions per place. [2025-03-08 21:38:16,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 808 places, 813 transitions, 1630 flow [2025-03-08 21:38:16,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 808 places, 813 transitions, 1630 flow [2025-03-08 21:38:16,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:38:16,791 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;@5c8d9dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:38:16,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-08 21:38:16,864 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:38:16,864 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-03-08 21:38:16,864 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:38:16,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:16,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:16,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-03-08 21:38:16,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1336176391, now seen corresponding path program 1 times [2025-03-08 21:38:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:16,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132670800] [2025-03-08 21:38:16,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:17,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-08 21:38:17,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-08 21:38:17,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:17,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:38:19,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:19,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132670800] [2025-03-08 21:38:19,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132670800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:38:19,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:38:19,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:38:19,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668207577] [2025-03-08 21:38:19,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:38:19,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:38:19,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:19,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:38:19,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:38:19,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 784 out of 813 [2025-03-08 21:38:19,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 813 transitions, 1630 flow. Second operand has 2 states, 2 states have (on average 785.0) internal successors, (1570), 2 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:19,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:19,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 784 of 813 [2025-03-08 21:38:19,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:19,945 INFO L124 PetriNetUnfolderBase]: 6/791 cut-off events. [2025-03-08 21:38:19,945 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:38:19,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 791 events. 6/791 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 9/784 useless extension candidates. Maximal degree in co-relation 134. Up to 11 conditions per place. [2025-03-08 21:38:19,948 INFO L140 encePairwiseOnDemand]: 794/813 looper letters, 10 selfloop transitions, 0 changer transitions 0/788 dead transitions. [2025-03-08 21:38:19,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 788 transitions, 1600 flow [2025-03-08 21:38:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:38:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:38:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1597 transitions. [2025-03-08 21:38:19,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9821648216482165 [2025-03-08 21:38:19,965 INFO L175 Difference]: Start difference. First operand has 808 places, 813 transitions, 1630 flow. Second operand 2 states and 1597 transitions. [2025-03-08 21:38:19,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 788 transitions, 1600 flow [2025-03-08 21:38:19,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 788 transitions, 1600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:38:19,984 INFO L231 Difference]: Finished difference. Result has 786 places, 788 transitions, 1580 flow [2025-03-08 21:38:19,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=813, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=785, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1580, PETRI_PLACES=786, PETRI_TRANSITIONS=788} [2025-03-08 21:38:19,990 INFO L279 CegarLoopForPetriNet]: 808 programPoint places, -22 predicate places. [2025-03-08 21:38:19,990 INFO L471 AbstractCegarLoop]: Abstraction has has 786 places, 788 transitions, 1580 flow [2025-03-08 21:38:19,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 785.0) internal successors, (1570), 2 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:19,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:19,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:19,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:38:19,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-03-08 21:38:19,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash -129640117, now seen corresponding path program 1 times [2025-03-08 21:38:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:19,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330090700] [2025-03-08 21:38:19,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:20,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-08 21:38:20,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-08 21:38:20,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:20,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:38:20,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:20,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330090700] [2025-03-08 21:38:20,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330090700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:38:20,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:38:20,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:38:20,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650821713] [2025-03-08 21:38:20,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:38:20,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:38:20,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:20,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:38:20,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:38:20,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 780 out of 813 [2025-03-08 21:38:20,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 786 places, 788 transitions, 1580 flow. Second operand has 3 states, 3 states have (on average 781.3333333333334) internal successors, (2344), 3 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:20,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:20,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 780 of 813 [2025-03-08 21:38:20,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:20,623 INFO L124 PetriNetUnfolderBase]: 10/886 cut-off events. [2025-03-08 21:38:20,623 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:38:20,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 886 events. 10/886 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 466 event pairs, 0 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 909. Up to 12 conditions per place. [2025-03-08 21:38:20,626 INFO L140 encePairwiseOnDemand]: 810/813 looper letters, 19 selfloop transitions, 2 changer transitions 0/795 dead transitions. [2025-03-08 21:38:20,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 787 places, 795 transitions, 1636 flow [2025-03-08 21:38:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:38:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:38:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2362 transitions. [2025-03-08 21:38:20,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.968429684296843 [2025-03-08 21:38:20,631 INFO L175 Difference]: Start difference. First operand has 786 places, 788 transitions, 1580 flow. Second operand 3 states and 2362 transitions. [2025-03-08 21:38:20,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 787 places, 795 transitions, 1636 flow [2025-03-08 21:38:20,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 787 places, 795 transitions, 1636 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:38:20,645 INFO L231 Difference]: Finished difference. Result has 787 places, 787 transitions, 1582 flow [2025-03-08 21:38:20,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=813, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=785, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1582, PETRI_PLACES=787, PETRI_TRANSITIONS=787} [2025-03-08 21:38:20,647 INFO L279 CegarLoopForPetriNet]: 808 programPoint places, -21 predicate places. [2025-03-08 21:38:20,647 INFO L471 AbstractCegarLoop]: Abstraction has has 787 places, 787 transitions, 1582 flow [2025-03-08 21:38:20,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 781.3333333333334) internal successors, (2344), 3 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:20,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:20,649 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:20,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:38:20,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-03-08 21:38:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash 178396659, now seen corresponding path program 1 times [2025-03-08 21:38:20,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:20,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977578491] [2025-03-08 21:38:20,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:20,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-08 21:38:20,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-08 21:38:20,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:20,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:38:20,866 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:38:20,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-08 21:38:20,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-08 21:38:20,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:20,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:38:21,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:38:21,126 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:38:21,127 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-03-08 21:38:21,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-03-08 21:38:21,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-03-08 21:38:21,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-03-08 21:38:21,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-03-08 21:38:21,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-03-08 21:38:21,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-03-08 21:38:21,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-03-08 21:38:21,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-03-08 21:38:21,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-03-08 21:38:21,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-03-08 21:38:21,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-03-08 21:38:21,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-03-08 21:38:21,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-03-08 21:38:21,130 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-03-08 21:38:21,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-03-08 21:38:21,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-03-08 21:38:21,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-03-08 21:38:21,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-03-08 21:38:21,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-03-08 21:38:21,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-03-08 21:38:21,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-03-08 21:38:21,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-03-08 21:38:21,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:38:21,134 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 21:38:21,136 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:38:21,136 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 21:38:21,235 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:38:21,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 944 places, 955 transitions, 1920 flow [2025-03-08 21:38:21,468 INFO L124 PetriNetUnfolderBase]: 16/971 cut-off events. [2025-03-08 21:38:21,468 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:38:21,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 971 events. 16/971 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 999 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 821. Up to 3 conditions per place. [2025-03-08 21:38:21,475 INFO L82 GeneralOperation]: Start removeDead. Operand has 944 places, 955 transitions, 1920 flow [2025-03-08 21:38:21,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 944 places, 955 transitions, 1920 flow [2025-03-08 21:38:21,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:38:21,486 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;@5c8d9dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:38:21,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-03-08 21:38:21,567 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:38:21,568 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-03-08 21:38:21,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:38:21,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:21,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:21,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-08 21:38:21,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:21,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1272977871, now seen corresponding path program 1 times [2025-03-08 21:38:21,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:21,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656725432] [2025-03-08 21:38:21,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:21,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-08 21:38:21,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-08 21:38:21,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:21,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:38:23,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:23,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656725432] [2025-03-08 21:38:23,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656725432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:38:23,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:38:23,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:38:23,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742919211] [2025-03-08 21:38:23,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:38:23,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:38:23,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:23,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:38:23,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:38:23,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 898 out of 955 [2025-03-08 21:38:23,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 955 transitions, 1920 flow. Second operand has 2 states, 2 states have (on average 899.0) internal successors, (1798), 2 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:23,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:23,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 898 of 955 [2025-03-08 21:38:23,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:23,657 INFO L124 PetriNetUnfolderBase]: 140/2036 cut-off events. [2025-03-08 21:38:23,658 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-08 21:38:23,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2240 conditions, 2036 events. 140/2036 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8923 event pairs, 52 based on Foata normal form. 89/1936 useless extension candidates. Maximal degree in co-relation 1399. Up to 178 conditions per place. [2025-03-08 21:38:23,673 INFO L140 encePairwiseOnDemand]: 918/955 looper letters, 20 selfloop transitions, 0 changer transitions 0/909 dead transitions. [2025-03-08 21:38:23,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 909 transitions, 1868 flow [2025-03-08 21:38:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:38:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:38:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1853 transitions. [2025-03-08 21:38:23,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9701570680628272 [2025-03-08 21:38:23,677 INFO L175 Difference]: Start difference. First operand has 944 places, 955 transitions, 1920 flow. Second operand 2 states and 1853 transitions. [2025-03-08 21:38:23,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 909 transitions, 1868 flow [2025-03-08 21:38:23,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 903 places, 909 transitions, 1868 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:38:23,690 INFO L231 Difference]: Finished difference. Result has 903 places, 909 transitions, 1828 flow [2025-03-08 21:38:23,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=955, PETRI_DIFFERENCE_MINUEND_FLOW=1828, PETRI_DIFFERENCE_MINUEND_PLACES=902, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=909, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1828, PETRI_PLACES=903, PETRI_TRANSITIONS=909} [2025-03-08 21:38:23,693 INFO L279 CegarLoopForPetriNet]: 944 programPoint places, -41 predicate places. [2025-03-08 21:38:23,693 INFO L471 AbstractCegarLoop]: Abstraction has has 903 places, 909 transitions, 1828 flow [2025-03-08 21:38:23,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 899.0) internal successors, (1798), 2 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:23,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:23,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:23,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:38:23,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-08 21:38:23,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash -733840621, now seen corresponding path program 1 times [2025-03-08 21:38:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720432379] [2025-03-08 21:38:23,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:23,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-08 21:38:23,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-08 21:38:23,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:23,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:38:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720432379] [2025-03-08 21:38:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720432379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:38:24,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:38:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:38:24,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114229086] [2025-03-08 21:38:24,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:38:24,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:38:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:24,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:38:24,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:38:24,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 890 out of 955 [2025-03-08 21:38:24,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 903 places, 909 transitions, 1828 flow. Second operand has 3 states, 3 states have (on average 891.3333333333334) internal successors, (2674), 3 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:24,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:24,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 890 of 955 [2025-03-08 21:38:24,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:25,194 INFO L124 PetriNetUnfolderBase]: 447/4559 cut-off events. [2025-03-08 21:38:25,195 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-08 21:38:25,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5236 conditions, 4559 events. 447/4559 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34968 event pairs, 99 based on Foata normal form. 0/4034 useless extension candidates. Maximal degree in co-relation 5231. Up to 318 conditions per place. [2025-03-08 21:38:25,221 INFO L140 encePairwiseOnDemand]: 947/955 looper letters, 47 selfloop transitions, 6 changer transitions 0/934 dead transitions. [2025-03-08 21:38:25,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 934 transitions, 1989 flow [2025-03-08 21:38:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:38:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:38:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2725 transitions. [2025-03-08 21:38:25,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511343804537522 [2025-03-08 21:38:25,227 INFO L175 Difference]: Start difference. First operand has 903 places, 909 transitions, 1828 flow. Second operand 3 states and 2725 transitions. [2025-03-08 21:38:25,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 934 transitions, 1989 flow [2025-03-08 21:38:25,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 934 transitions, 1989 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:38:25,237 INFO L231 Difference]: Finished difference. Result has 907 places, 915 transitions, 1880 flow [2025-03-08 21:38:25,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=955, PETRI_DIFFERENCE_MINUEND_FLOW=1828, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=909, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=903, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1880, PETRI_PLACES=907, PETRI_TRANSITIONS=915} [2025-03-08 21:38:25,240 INFO L279 CegarLoopForPetriNet]: 944 programPoint places, -37 predicate places. [2025-03-08 21:38:25,241 INFO L471 AbstractCegarLoop]: Abstraction has has 907 places, 915 transitions, 1880 flow [2025-03-08 21:38:25,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 891.3333333333334) internal successors, (2674), 3 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:25,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:25,243 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:25,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:38:25,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-03-08 21:38:25,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1943702404, now seen corresponding path program 1 times [2025-03-08 21:38:25,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:25,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146700977] [2025-03-08 21:38:25,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:25,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-03-08 21:38:25,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-03-08 21:38:25,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:38:25,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:38:25,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-03-08 21:38:25,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-03-08 21:38:25,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:25,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:38:25,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:38:25,548 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:38:25,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2025-03-08 21:38:25,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-03-08 21:38:25,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-03-08 21:38:25,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-03-08 21:38:25,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-03-08 21:38:25,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-03-08 21:38:25,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-03-08 21:38:25,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-03-08 21:38:25,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-03-08 21:38:25,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-03-08 21:38:25,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-03-08 21:38:25,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-03-08 21:38:25,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-03-08 21:38:25,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-03-08 21:38:25,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-03-08 21:38:25,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-03-08 21:38:25,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-03-08 21:38:25,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-03-08 21:38:25,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-03-08 21:38:25,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-03-08 21:38:25,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-03-08 21:38:25,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-03-08 21:38:25,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-03-08 21:38:25,555 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-03-08 21:38:25,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:38:25,555 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 21:38:25,556 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 21:38:25,556 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 21:38:25,651 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:38:25,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1080 places, 1097 transitions, 2212 flow [2025-03-08 21:38:25,841 INFO L124 PetriNetUnfolderBase]: 24/1122 cut-off events. [2025-03-08 21:38:25,841 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 21:38:25,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 1122 events. 24/1122 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1926 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 975. Up to 4 conditions per place. [2025-03-08 21:38:25,849 INFO L82 GeneralOperation]: Start removeDead. Operand has 1080 places, 1097 transitions, 2212 flow [2025-03-08 21:38:25,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1080 places, 1097 transitions, 2212 flow [2025-03-08 21:38:25,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:38:25,864 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;@5c8d9dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:38:25,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-03-08 21:38:25,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:38:25,912 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-03-08 21:38:25,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:38:25,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:25,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:25,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-03-08 21:38:25,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:25,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1384748229, now seen corresponding path program 1 times [2025-03-08 21:38:25,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:25,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751162963] [2025-03-08 21:38:25,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:25,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:25,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-08 21:38:26,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-08 21:38:26,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:26,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:38:26,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:26,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751162963] [2025-03-08 21:38:26,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751162963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:38:26,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:38:26,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-08 21:38:26,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330808518] [2025-03-08 21:38:26,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:38:26,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:38:26,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:26,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:38:26,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:38:26,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1012 out of 1097 [2025-03-08 21:38:26,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1080 places, 1097 transitions, 2212 flow. Second operand has 2 states, 2 states have (on average 1013.0) internal successors, (2026), 2 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:26,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:26,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1012 of 1097 [2025-03-08 21:38:26,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:29,782 INFO L124 PetriNetUnfolderBase]: 2072/13930 cut-off events. [2025-03-08 21:38:29,782 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2025-03-08 21:38:29,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16625 conditions, 13930 events. 2072/13930 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 149282 event pairs, 962 based on Foata normal form. 959/13097 useless extension candidates. Maximal degree in co-relation 14020. Up to 2424 conditions per place. [2025-03-08 21:38:29,945 INFO L140 encePairwiseOnDemand]: 1042/1097 looper letters, 30 selfloop transitions, 0 changer transitions 0/1030 dead transitions. [2025-03-08 21:38:29,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1030 transitions, 2138 flow [2025-03-08 21:38:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:38:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 21:38:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2109 transitions. [2025-03-08 21:38:29,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9612579762989972 [2025-03-08 21:38:29,950 INFO L175 Difference]: Start difference. First operand has 1080 places, 1097 transitions, 2212 flow. Second operand 2 states and 2109 transitions. [2025-03-08 21:38:29,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1030 transitions, 2138 flow [2025-03-08 21:38:29,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1030 transitions, 2136 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-08 21:38:29,962 INFO L231 Difference]: Finished difference. Result has 1020 places, 1030 transitions, 2076 flow [2025-03-08 21:38:29,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1097, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1030, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2076, PETRI_PLACES=1020, PETRI_TRANSITIONS=1030} [2025-03-08 21:38:29,965 INFO L279 CegarLoopForPetriNet]: 1080 programPoint places, -60 predicate places. [2025-03-08 21:38:29,965 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1030 transitions, 2076 flow [2025-03-08 21:38:29,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1013.0) internal successors, (2026), 2 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:29,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:29,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:29,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:38:29,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-03-08 21:38:29,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash -696673879, now seen corresponding path program 1 times [2025-03-08 21:38:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:29,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950361] [2025-03-08 21:38:29,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:30,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-08 21:38:30,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-08 21:38:30,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:30,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:38:30,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:30,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950361] [2025-03-08 21:38:30,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:38:30,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:38:30,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:38:30,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472095643] [2025-03-08 21:38:30,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:38:30,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:38:30,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:30,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:38:30,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:38:30,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1000 out of 1097 [2025-03-08 21:38:30,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1030 transitions, 2076 flow. Second operand has 3 states, 3 states have (on average 1001.3333333333334) internal successors, (3004), 3 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:30,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:30,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1000 of 1097 [2025-03-08 21:38:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:42,248 INFO L124 PetriNetUnfolderBase]: 10754/61147 cut-off events. [2025-03-08 21:38:42,249 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2025-03-08 21:38:42,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75291 conditions, 61147 events. 10754/61147 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 887782 event pairs, 2763 based on Foata normal form. 0/52782 useless extension candidates. Maximal degree in co-relation 75285. Up to 6800 conditions per place. [2025-03-08 21:38:42,899 INFO L140 encePairwiseOnDemand]: 1085/1097 looper letters, 71 selfloop transitions, 9 changer transitions 0/1068 dead transitions. [2025-03-08 21:38:42,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1068 transitions, 2322 flow [2025-03-08 21:38:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:38:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:38:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3083 transitions. [2025-03-08 21:38:42,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9367973260407171 [2025-03-08 21:38:42,905 INFO L175 Difference]: Start difference. First operand has 1020 places, 1030 transitions, 2076 flow. Second operand 3 states and 3083 transitions. [2025-03-08 21:38:42,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1068 transitions, 2322 flow [2025-03-08 21:38:42,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1068 transitions, 2322 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:38:42,918 INFO L231 Difference]: Finished difference. Result has 1024 places, 1039 transitions, 2154 flow [2025-03-08 21:38:42,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1097, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1030, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2154, PETRI_PLACES=1024, PETRI_TRANSITIONS=1039} [2025-03-08 21:38:42,921 INFO L279 CegarLoopForPetriNet]: 1080 programPoint places, -56 predicate places. [2025-03-08 21:38:42,921 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1039 transitions, 2154 flow [2025-03-08 21:38:42,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1001.3333333333334) internal successors, (3004), 3 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:42,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:38:42,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:38:42,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:38:42,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-03-08 21:38:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:38:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1563471081, now seen corresponding path program 1 times [2025-03-08 21:38:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:38:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624772743] [2025-03-08 21:38:42,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:38:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:38:42,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-08 21:38:43,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-08 21:38:43,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:38:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:38:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:38:44,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:38:44,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624772743] [2025-03-08 21:38:44,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624772743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:38:44,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:38:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:38:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27364198] [2025-03-08 21:38:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:38:44,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:38:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:38:44,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:38:44,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:38:44,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 979 out of 1097 [2025-03-08 21:38:44,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1039 transitions, 2154 flow. Second operand has 6 states, 6 states have (on average 980.6666666666666) internal successors, (5884), 6 states have internal predecessors, (5884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:38:44,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:38:44,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 979 of 1097 [2025-03-08 21:38:44,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:38:49,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][839], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 79#L785true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-08 21:38:49,190 INFO L294 olderBase$Statistics]: this new event has 723 ancestors and is cut-off event [2025-03-08 21:38:49,190 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-03-08 21:38:49,190 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-03-08 21:38:49,190 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-03-08 21:38:49,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 326#L793-2true, 1083#true, 1031#L785true, 1090#true, 482#EBStack_init_returnLabel#1true, 1079#true, 79#L785true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-08 21:38:49,366 INFO L294 olderBase$Statistics]: this new event has 724 ancestors and is cut-off event [2025-03-08 21:38:49,366 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-03-08 21:38:49,366 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-03-08 21:38:49,368 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-03-08 21:38:49,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 326#L793-2true, 652#L781true, 1083#true, 1031#L785true, 1090#true, 1079#true, 79#L785true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-08 21:38:49,540 INFO L294 olderBase$Statistics]: this new event has 725 ancestors and is cut-off event [2025-03-08 21:38:49,540 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-03-08 21:38:49,540 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-03-08 21:38:49,540 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-03-08 21:38:50,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 274#L782-2true, 1087#(= |#race~state~0| 0), 1077#true, 725#L734-3true, 1081#true]) [2025-03-08 21:38:50,599 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-03-08 21:38:50,600 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-03-08 21:38:50,600 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-03-08 21:38:50,600 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-03-08 21:38:50,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 274#L782-2true, 304#L734-2true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-08 21:38:50,816 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-03-08 21:38:50,816 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-03-08 21:38:50,816 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-03-08 21:38:50,817 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-03-08 21:38:51,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 274#L782-2true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true, 23#L734true]) [2025-03-08 21:38:51,030 INFO L294 olderBase$Statistics]: this new event has 732 ancestors and is cut-off event [2025-03-08 21:38:51,030 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-03-08 21:38:51,030 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-03-08 21:38:51,030 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-03-08 21:38:51,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 274#L782-2true, 1087#(= |#race~state~0| 0), 1077#true, 330#L734-1true, 1081#true]) [2025-03-08 21:38:51,366 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-03-08 21:38:51,366 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-03-08 21:38:51,366 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-03-08 21:38:51,366 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-03-08 21:38:52,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 124#L734-4true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-08 21:38:52,313 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-03-08 21:38:52,313 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-03-08 21:38:52,313 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-03-08 21:38:52,313 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-03-08 21:38:52,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [57#L734-3true, 326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-08 21:38:52,728 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-03-08 21:38:52,728 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-03-08 21:38:52,728 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-03-08 21:38:52,728 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-03-08 21:38:53,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 35#L734-2true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-08 21:38:53,007 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-03-08 21:38:53,007 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-03-08 21:38:53,007 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-03-08 21:38:53,007 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-03-08 21:38:53,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 1083#true, 823#L734true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-08 21:38:53,291 INFO L294 olderBase$Statistics]: this new event has 740 ancestors and is cut-off event [2025-03-08 21:38:53,291 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-03-08 21:38:53,291 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-03-08 21:38:53,291 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-03-08 21:38:53,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][839], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-08 21:38:53,580 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-03-08 21:38:53,580 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-08 21:38:53,580 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-08 21:38:53,580 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-08 21:38:53,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-08 21:38:53,581 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-03-08 21:38:53,581 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-08 21:38:53,581 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-08 21:38:53,581 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-08 21:38:53,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 832#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-08 21:38:53,581 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-03-08 21:38:53,581 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-08 21:38:53,581 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-08 21:38:53,581 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-08 21:38:53,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 124#L734-4true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-08 21:38:53,585 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-03-08 21:38:53,585 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-08 21:38:53,585 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-08 21:38:53,585 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-08 21:38:54,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 326#L793-2true, 1083#true, 1031#L785true, 482#EBStack_init_returnLabel#1true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-08 21:38:54,095 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-03-08 21:38:54,095 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-03-08 21:38:54,095 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-03-08 21:38:54,095 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-03-08 21:38:54,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [57#L734-3true, 326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-08 21:38:54,100 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-03-08 21:38:54,100 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-03-08 21:38:54,100 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-03-08 21:38:54,100 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-03-08 21:38:54,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 326#L793-2true, 652#L781true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-08 21:38:54,550 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-03-08 21:38:54,550 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-03-08 21:38:54,550 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-03-08 21:38:54,550 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-03-08 21:38:54,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 35#L734-2true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-08 21:38:54,554 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-03-08 21:38:54,554 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-03-08 21:38:54,554 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-03-08 21:38:54,554 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-03-08 21:38:54,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 1083#true, 823#L734true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-08 21:38:54,983 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-03-08 21:38:54,983 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-03-08 21:38:54,983 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-03-08 21:38:54,983 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-03-08 21:38:55,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][839], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-08 21:38:55,435 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-03-08 21:38:55,435 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-03-08 21:38:55,436 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-08 21:38:55,436 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-08 21:38:55,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-08 21:38:55,436 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-03-08 21:38:55,436 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-03-08 21:38:55,436 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-08 21:38:55,436 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-08 21:38:55,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 832#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-08 21:38:55,437 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-03-08 21:38:55,437 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-08 21:38:55,437 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-03-08 21:38:55,437 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-08 21:38:55,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 326#L793-2true, 1083#true, 1031#L785true, 1090#true, 482#EBStack_init_returnLabel#1true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-08 21:38:55,972 INFO L294 olderBase$Statistics]: this new event has 746 ancestors and is cut-off event [2025-03-08 21:38:55,972 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-03-08 21:38:55,973 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-03-08 21:38:55,973 INFO L297 olderBase$Statistics]: existing Event has 746 ancestors and is cut-off event [2025-03-08 21:38:56,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 326#L793-2true, 652#L781true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-08 21:38:56,306 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-03-08 21:38:56,306 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-03-08 21:38:56,306 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-03-08 21:38:56,306 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-03-08 21:39:00,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 832#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 574#L731-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-08 21:39:00,233 INFO L294 olderBase$Statistics]: this new event has 755 ancestors and is cut-off event [2025-03-08 21:39:00,233 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-08 21:39:00,233 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-08 21:39:00,233 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2025-03-08 21:39:00,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 124#L734-4true, 418#L753-4true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-08 21:39:00,239 INFO L294 olderBase$Statistics]: this new event has 755 ancestors and is cut-off event [2025-03-08 21:39:00,239 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-08 21:39:00,239 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2025-03-08 21:39:00,239 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-08 21:39:00,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4182] L784-3-->L785: Formula: (let ((.cse1 (select |v_#race_869| |v_~#m2~0.base_19|))) (let ((.cse4 (select |v_#memory_int_275| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 1)) (.cse2 (+ |v_~#m2~0.offset_19| 2)) (.cse5 (+ |v_~#m2~0.offset_19| 3)) (.cse0 (select .cse1 |v_~#m2~0.offset_19|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse1 .cse5) .cse0) (= (store |v_#memory_int_275| |v_~#m2~0.base_19| (store .cse4 |v_~#m2~0.offset_19| 0)) |v_#memory_int_274|) (= |v_#race_869| (store |v_#race_871| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_871| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse0) .cse3 .cse0) .cse2 .cse0) .cse5 .cse0)))))) InVars {#race=|v_#race_871|, #memory_int=|v_#memory_int_275|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_869|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_274|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [326#L793-2true, Black: 1085#true, 57#L734-3true, 418#L753-4true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-08 21:39:00,831 INFO L294 olderBase$Statistics]: this new event has 756 ancestors and is cut-off event [2025-03-08 21:39:00,831 INFO L297 olderBase$Statistics]: existing Event has 756 ancestors and is cut-off event [2025-03-08 21:39:00,831 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-03-08 21:39:00,831 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event