./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack_longest-2-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack_longest-2-race.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 93834d0ed7ae29f55a5cf3676a6d16497c83e10891cd8a2ab18e9898a90eaebc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 16:46:57,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 16:46:57,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 16:46:57,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 16:46:57,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 16:46:57,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 16:46:57,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 16:46:57,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 16:46:57,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 16:46:57,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 16:46:57,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 16:46:57,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 16:46:57,916 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 16:46:57,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 16:46:57,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 16:46:57,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 16:46:57,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 16:46:57,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 16:46:57,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 16:46:57,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 16:46:57,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 16:46:57,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 16:46:57,925 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 16:46:57,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 16:46:57,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 16:46:57,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 16:46:57,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 16:46:57,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 16:46:57,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 16:46:57,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 16:46:57,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 16:46:57,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:46:57,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 16:46:57,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 16:46:57,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 16:46:57,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 16:46:57,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 16:46:57,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 16:46:57,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 16:46:57,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 16:46:57,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 16:46:57,932 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 93834d0ed7ae29f55a5cf3676a6d16497c83e10891cd8a2ab18e9898a90eaebc [2024-10-14 16:46:58,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 16:46:58,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 16:46:58,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 16:46:58,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 16:46:58,144 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 16:46:58,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack_longest-2-race.i [2024-10-14 16:46:59,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 16:46:59,741 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 16:46:59,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack_longest-2-race.i [2024-10-14 16:46:59,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad0c559d/6f5613a426aa46a4ae2be55571141d3c/FLAG53f00675d [2024-10-14 16:46:59,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad0c559d/6f5613a426aa46a4ae2be55571141d3c [2024-10-14 16:46:59,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 16:46:59,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 16:46:59,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 16:46:59,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 16:46:59,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 16:46:59,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:46:59" (1/1) ... [2024-10-14 16:46:59,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a76af90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:46:59, skipping insertion in model container [2024-10-14 16:46:59,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:46:59" (1/1) ... [2024-10-14 16:46:59,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 16:47:00,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:47:00,179 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 16:47:00,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:47:00,256 INFO L204 MainTranslator]: Completed translation [2024-10-14 16:47:00,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00 WrapperNode [2024-10-14 16:47:00,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 16:47:00,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 16:47:00,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 16:47:00,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 16:47:00,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,310 INFO L138 Inliner]: procedures = 176, calls = 32, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 294 [2024-10-14 16:47:00,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 16:47:00,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 16:47:00,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 16:47:00,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 16:47:00,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 16:47:00,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 16:47:00,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 16:47:00,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 16:47:00,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (1/1) ... [2024-10-14 16:47:00,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:47:00,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:47:00,432 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) [2024-10-14 16:47:00,435 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 [2024-10-14 16:47:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 16:47:00,482 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-14 16:47:00,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-14 16:47:00,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 16:47:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 16:47:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 16:47:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 16:47:00,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 16:47:00,489 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 16:47:00,657 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 16:47:00,658 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 16:47:01,309 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 16:47:01,309 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 16:47:01,524 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 16:47:01,524 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 16:47:01,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:47:01 BoogieIcfgContainer [2024-10-14 16:47:01,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 16:47:01,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 16:47:01,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 16:47:01,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 16:47:01,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:46:59" (1/3) ... [2024-10-14 16:47:01,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1a656a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:47:01, skipping insertion in model container [2024-10-14 16:47:01,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:47:00" (2/3) ... [2024-10-14 16:47:01,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1a656a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:47:01, skipping insertion in model container [2024-10-14 16:47:01,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:47:01" (3/3) ... [2024-10-14 16:47:01,533 INFO L112 eAbstractionObserver]: Analyzing ICFG 25_stack_longest-2-race.i [2024-10-14 16:47:01,554 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 16:47:01,555 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-14 16:47:01,555 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 16:47:01,623 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 16:47:01,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 160 transitions, 324 flow [2024-10-14 16:47:01,721 INFO L124 PetriNetUnfolderBase]: 8/169 cut-off events. [2024-10-14 16:47:01,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 16:47:01,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 169 events. 8/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 228 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 139. Up to 4 conditions per place. [2024-10-14 16:47:01,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 160 transitions, 324 flow [2024-10-14 16:47:01,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 160 transitions, 324 flow [2024-10-14 16:47:01,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 16:47:01,758 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;@7eebdcaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 16:47:01,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2024-10-14 16:47:01,764 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 16:47:01,764 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2024-10-14 16:47:01,764 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 16:47:01,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:01,765 INFO L204 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] [2024-10-14 16:47:01,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2024-10-14 16:47:01,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:01,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1212610649, now seen corresponding path program 1 times [2024-10-14 16:47:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:01,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572742988] [2024-10-14 16:47:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:47:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:47:02,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:47:02,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572742988] [2024-10-14 16:47:02,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572742988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:47:02,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:47:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 16:47:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377812006] [2024-10-14 16:47:02,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:47:02,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 16:47:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:47:02,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 16:47:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:47:02,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 160 [2024-10-14 16:47:02,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 160 transitions, 324 flow. Second operand has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 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) [2024-10-14 16:47:02,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:47:02,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 160 [2024-10-14 16:47:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:47:02,261 INFO L124 PetriNetUnfolderBase]: 4/141 cut-off events. [2024-10-14 16:47:02,262 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 16:47:02,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 141 events. 4/141 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 139 event pairs, 0 based on Foata normal form. 9/135 useless extension candidates. Maximal degree in co-relation 124. Up to 10 conditions per place. [2024-10-14 16:47:02,263 INFO L140 encePairwiseOnDemand]: 141/160 looper letters, 9 selfloop transitions, 0 changer transitions 0/137 dead transitions. [2024-10-14 16:47:02,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 137 transitions, 296 flow [2024-10-14 16:47:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 16:47:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-14 16:47:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2024-10-14 16:47:02,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9125 [2024-10-14 16:47:02,278 INFO L175 Difference]: Start difference. First operand has 156 places, 160 transitions, 324 flow. Second operand 2 states and 292 transitions. [2024-10-14 16:47:02,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 137 transitions, 296 flow [2024-10-14 16:47:02,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 16:47:02,284 INFO L231 Difference]: Finished difference. Result has 137 places, 137 transitions, 278 flow [2024-10-14 16:47:02,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=278, PETRI_PLACES=137, PETRI_TRANSITIONS=137} [2024-10-14 16:47:02,290 INFO L277 CegarLoopForPetriNet]: 156 programPoint places, -19 predicate places. [2024-10-14 16:47:02,290 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 137 transitions, 278 flow [2024-10-14 16:47:02,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.0) internal successors, (266), 2 states have internal predecessors, (266), 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) [2024-10-14 16:47:02,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:02,291 INFO L204 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] [2024-10-14 16:47:02,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 16:47:02,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2024-10-14 16:47:02,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1382666710, now seen corresponding path program 1 times [2024-10-14 16:47:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:02,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102071350] [2024-10-14 16:47:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:47:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:47:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:47:02,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102071350] [2024-10-14 16:47:02,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102071350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:47:02,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:47:02,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:47:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383400680] [2024-10-14 16:47:02,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:47:02,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:47:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:47:02,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:47:02,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:47:02,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 160 [2024-10-14 16:47:02,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2024-10-14 16:47:02,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:47:02,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 160 [2024-10-14 16:47:02,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:47:02,426 INFO L124 PetriNetUnfolderBase]: 6/229 cut-off events. [2024-10-14 16:47:02,426 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 16:47:02,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 229 events. 6/229 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 439 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 250. Up to 11 conditions per place. [2024-10-14 16:47:02,428 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 17 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2024-10-14 16:47:02,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 143 transitions, 328 flow [2024-10-14 16:47:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:47:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:47:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-10-14 16:47:02,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2024-10-14 16:47:02,433 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 278 flow. Second operand 3 states and 404 transitions. [2024-10-14 16:47:02,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 143 transitions, 328 flow [2024-10-14 16:47:02,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 143 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 16:47:02,438 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 280 flow [2024-10-14 16:47:02,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2024-10-14 16:47:02,439 INFO L277 CegarLoopForPetriNet]: 156 programPoint places, -18 predicate places. [2024-10-14 16:47:02,439 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 280 flow [2024-10-14 16:47:02,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2024-10-14 16:47:02,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:02,440 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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] [2024-10-14 16:47:02,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 16:47:02,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2024-10-14 16:47:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash 218972639, now seen corresponding path program 1 times [2024-10-14 16:47:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512028980] [2024-10-14 16:47:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 16:47:02,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 16:47:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 16:47:02,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 16:47:02,479 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 16:47:02,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2024-10-14 16:47:02,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2024-10-14 16:47:02,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2024-10-14 16:47:02,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2024-10-14 16:47:02,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2024-10-14 16:47:02,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2024-10-14 16:47:02,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2024-10-14 16:47:02,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2024-10-14 16:47:02,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2024-10-14 16:47:02,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2024-10-14 16:47:02,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2024-10-14 16:47:02,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2024-10-14 16:47:02,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2024-10-14 16:47:02,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2024-10-14 16:47:02,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2024-10-14 16:47:02,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2024-10-14 16:47:02,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2024-10-14 16:47:02,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2024-10-14 16:47:02,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2024-10-14 16:47:02,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2024-10-14 16:47:02,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2024-10-14 16:47:02,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2024-10-14 16:47:02,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2024-10-14 16:47:02,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2024-10-14 16:47:02,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2024-10-14 16:47:02,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2024-10-14 16:47:02,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2024-10-14 16:47:02,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2024-10-14 16:47:02,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2024-10-14 16:47:02,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2024-10-14 16:47:02,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2024-10-14 16:47:02,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2024-10-14 16:47:02,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2024-10-14 16:47:02,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2024-10-14 16:47:02,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2024-10-14 16:47:02,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2024-10-14 16:47:02,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2024-10-14 16:47:02,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2024-10-14 16:47:02,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2024-10-14 16:47:02,490 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2024-10-14 16:47:02,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2024-10-14 16:47:02,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2024-10-14 16:47:02,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2024-10-14 16:47:02,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2024-10-14 16:47:02,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2024-10-14 16:47:02,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2024-10-14 16:47:02,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2024-10-14 16:47:02,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2024-10-14 16:47:02,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2024-10-14 16:47:02,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2024-10-14 16:47:02,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2024-10-14 16:47:02,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2024-10-14 16:47:02,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2024-10-14 16:47:02,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 16:47:02,493 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 16:47:02,495 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 16:47:02,495 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-14 16:47:02,557 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 16:47:02,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 281 places, 289 transitions, 588 flow [2024-10-14 16:47:02,607 INFO L124 PetriNetUnfolderBase]: 15/309 cut-off events. [2024-10-14 16:47:02,607 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 16:47:02,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 309 events. 15/309 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 878 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 267. Up to 6 conditions per place. [2024-10-14 16:47:02,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 281 places, 289 transitions, 588 flow [2024-10-14 16:47:02,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 281 places, 289 transitions, 588 flow [2024-10-14 16:47:02,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 16:47:02,621 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;@7eebdcaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 16:47:02,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-10-14 16:47:02,624 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 16:47:02,624 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-10-14 16:47:02,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 16:47:02,625 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:02,625 INFO L204 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] [2024-10-14 16:47:02,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-10-14 16:47:02,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:02,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1035951559, now seen corresponding path program 1 times [2024-10-14 16:47:02,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:02,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726539536] [2024-10-14 16:47:02,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:47:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:47:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:47:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726539536] [2024-10-14 16:47:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726539536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:47:02,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:47:02,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 16:47:02,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58640939] [2024-10-14 16:47:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:47:02,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 16:47:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:47:02,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 16:47:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:47:02,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 289 [2024-10-14 16:47:02,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 289 transitions, 588 flow. Second operand has 2 states, 2 states have (on average 236.0) internal successors, (472), 2 states have internal predecessors, (472), 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) [2024-10-14 16:47:02,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:47:02,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 289 [2024-10-14 16:47:02,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:47:03,015 INFO L124 PetriNetUnfolderBase]: 112/1284 cut-off events. [2024-10-14 16:47:03,016 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-14 16:47:03,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 1284 events. 112/1284 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8176 event pairs, 52 based on Foata normal form. 91/1202 useless extension candidates. Maximal degree in co-relation 1281. Up to 161 conditions per place. [2024-10-14 16:47:03,027 INFO L140 encePairwiseOnDemand]: 253/289 looper letters, 18 selfloop transitions, 0 changer transitions 0/248 dead transitions. [2024-10-14 16:47:03,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 248 transitions, 542 flow [2024-10-14 16:47:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 16:47:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-14 16:47:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 524 transitions. [2024-10-14 16:47:03,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065743944636678 [2024-10-14 16:47:03,030 INFO L175 Difference]: Start difference. First operand has 281 places, 289 transitions, 588 flow. Second operand 2 states and 524 transitions. [2024-10-14 16:47:03,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 248 transitions, 542 flow [2024-10-14 16:47:03,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 248 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 16:47:03,034 INFO L231 Difference]: Finished difference. Result has 246 places, 248 transitions, 506 flow [2024-10-14 16:47:03,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=506, PETRI_PLACES=246, PETRI_TRANSITIONS=248} [2024-10-14 16:47:03,035 INFO L277 CegarLoopForPetriNet]: 281 programPoint places, -35 predicate places. [2024-10-14 16:47:03,035 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 248 transitions, 506 flow [2024-10-14 16:47:03,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 236.0) internal successors, (472), 2 states have internal predecessors, (472), 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) [2024-10-14 16:47:03,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:03,036 INFO L204 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] [2024-10-14 16:47:03,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 16:47:03,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-10-14 16:47:03,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash -882921366, now seen corresponding path program 1 times [2024-10-14 16:47:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:03,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704340190] [2024-10-14 16:47:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:47:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:47:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:47:03,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704340190] [2024-10-14 16:47:03,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704340190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:47:03,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:47:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:47:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602381019] [2024-10-14 16:47:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:47:03,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:47:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:47:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:47:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:47:03,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 289 [2024-10-14 16:47:03,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 248 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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) [2024-10-14 16:47:03,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:47:03,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 289 [2024-10-14 16:47:03,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:47:03,424 INFO L124 PetriNetUnfolderBase]: 368/3624 cut-off events. [2024-10-14 16:47:03,424 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-14 16:47:03,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4253 conditions, 3624 events. 368/3624 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 32549 event pairs, 99 based on Foata normal form. 0/3145 useless extension candidates. Maximal degree in co-relation 4248. Up to 293 conditions per place. [2024-10-14 16:47:03,456 INFO L140 encePairwiseOnDemand]: 281/289 looper letters, 43 selfloop transitions, 6 changer transitions 0/271 dead transitions. [2024-10-14 16:47:03,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 271 transitions, 655 flow [2024-10-14 16:47:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:47:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:47:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2024-10-14 16:47:03,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8442906574394463 [2024-10-14 16:47:03,458 INFO L175 Difference]: Start difference. First operand has 246 places, 248 transitions, 506 flow. Second operand 3 states and 732 transitions. [2024-10-14 16:47:03,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 271 transitions, 655 flow [2024-10-14 16:47:03,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 271 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 16:47:03,462 INFO L231 Difference]: Finished difference. Result has 250 places, 254 transitions, 558 flow [2024-10-14 16:47:03,462 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=250, PETRI_TRANSITIONS=254} [2024-10-14 16:47:03,464 INFO L277 CegarLoopForPetriNet]: 281 programPoint places, -31 predicate places. [2024-10-14 16:47:03,464 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 254 transitions, 558 flow [2024-10-14 16:47:03,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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) [2024-10-14 16:47:03,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:03,465 INFO L204 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] [2024-10-14 16:47:03,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 16:47:03,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-10-14 16:47:03,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 711728935, now seen corresponding path program 1 times [2024-10-14 16:47:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607292688] [2024-10-14 16:47:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:03,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:47:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:47:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:47:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607292688] [2024-10-14 16:47:03,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607292688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:47:03,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:47:03,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:47:03,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702207981] [2024-10-14 16:47:03,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:47:03,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:47:03,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:47:03,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:47:03,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:47:03,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 289 [2024-10-14 16:47:03,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 254 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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) [2024-10-14 16:47:03,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:47:03,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 289 [2024-10-14 16:47:03,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:47:04,032 INFO L124 PetriNetUnfolderBase]: 674/4832 cut-off events. [2024-10-14 16:47:04,033 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-10-14 16:47:04,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6088 conditions, 4832 events. 674/4832 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 45743 event pairs, 283 based on Foata normal form. 0/4169 useless extension candidates. Maximal degree in co-relation 6081. Up to 992 conditions per place. [2024-10-14 16:47:04,066 INFO L140 encePairwiseOnDemand]: 281/289 looper letters, 37 selfloop transitions, 7 changer transitions 0/268 dead transitions. [2024-10-14 16:47:04,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 268 transitions, 679 flow [2024-10-14 16:47:04,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:47:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:47:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-10-14 16:47:04,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2024-10-14 16:47:04,068 INFO L175 Difference]: Start difference. First operand has 250 places, 254 transitions, 558 flow. Second operand 3 states and 714 transitions. [2024-10-14 16:47:04,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 268 transitions, 679 flow [2024-10-14 16:47:04,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 268 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 16:47:04,073 INFO L231 Difference]: Finished difference. Result has 252 places, 260 transitions, 600 flow [2024-10-14 16:47:04,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=252, PETRI_TRANSITIONS=260} [2024-10-14 16:47:04,074 INFO L277 CegarLoopForPetriNet]: 281 programPoint places, -29 predicate places. [2024-10-14 16:47:04,074 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 260 transitions, 600 flow [2024-10-14 16:47:04,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 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) [2024-10-14 16:47:04,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:04,075 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 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] [2024-10-14 16:47:04,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 16:47:04,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-10-14 16:47:04,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1031003292, now seen corresponding path program 1 times [2024-10-14 16:47:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310849858] [2024-10-14 16:47:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 16:47:04,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 16:47:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 16:47:04,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 16:47:04,092 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 16:47:04,092 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2024-10-14 16:47:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2024-10-14 16:47:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2024-10-14 16:47:04,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2024-10-14 16:47:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2024-10-14 16:47:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2024-10-14 16:47:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2024-10-14 16:47:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2024-10-14 16:47:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2024-10-14 16:47:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2024-10-14 16:47:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2024-10-14 16:47:04,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2024-10-14 16:47:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2024-10-14 16:47:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2024-10-14 16:47:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2024-10-14 16:47:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2024-10-14 16:47:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2024-10-14 16:47:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2024-10-14 16:47:04,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2024-10-14 16:47:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2024-10-14 16:47:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2024-10-14 16:47:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2024-10-14 16:47:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2024-10-14 16:47:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2024-10-14 16:47:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2024-10-14 16:47:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2024-10-14 16:47:04,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2024-10-14 16:47:04,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2024-10-14 16:47:04,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2024-10-14 16:47:04,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2024-10-14 16:47:04,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2024-10-14 16:47:04,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2024-10-14 16:47:04,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2024-10-14 16:47:04,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2024-10-14 16:47:04,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2024-10-14 16:47:04,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2024-10-14 16:47:04,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2024-10-14 16:47:04,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2024-10-14 16:47:04,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2024-10-14 16:47:04,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2024-10-14 16:47:04,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2024-10-14 16:47:04,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2024-10-14 16:47:04,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2024-10-14 16:47:04,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2024-10-14 16:47:04,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2024-10-14 16:47:04,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2024-10-14 16:47:04,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2024-10-14 16:47:04,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2024-10-14 16:47:04,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2024-10-14 16:47:04,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2024-10-14 16:47:04,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2024-10-14 16:47:04,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2024-10-14 16:47:04,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2024-10-14 16:47:04,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2024-10-14 16:47:04,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2024-10-14 16:47:04,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2024-10-14 16:47:04,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2024-10-14 16:47:04,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2024-10-14 16:47:04,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2024-10-14 16:47:04,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2024-10-14 16:47:04,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2024-10-14 16:47:04,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2024-10-14 16:47:04,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2024-10-14 16:47:04,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2024-10-14 16:47:04,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2024-10-14 16:47:04,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2024-10-14 16:47:04,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2024-10-14 16:47:04,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2024-10-14 16:47:04,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2024-10-14 16:47:04,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2024-10-14 16:47:04,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2024-10-14 16:47:04,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2024-10-14 16:47:04,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2024-10-14 16:47:04,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2024-10-14 16:47:04,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2024-10-14 16:47:04,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2024-10-14 16:47:04,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2024-10-14 16:47:04,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2024-10-14 16:47:04,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2024-10-14 16:47:04,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 16:47:04,102 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 16:47:04,103 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 16:47:04,103 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-14 16:47:04,201 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 16:47:04,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 406 places, 418 transitions, 854 flow [2024-10-14 16:47:04,290 INFO L124 PetriNetUnfolderBase]: 22/449 cut-off events. [2024-10-14 16:47:04,290 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-14 16:47:04,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 449 events. 22/449 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1706 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 395. Up to 8 conditions per place. [2024-10-14 16:47:04,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 406 places, 418 transitions, 854 flow [2024-10-14 16:47:04,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 406 places, 418 transitions, 854 flow [2024-10-14 16:47:04,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 16:47:04,309 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;@7eebdcaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 16:47:04,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2024-10-14 16:47:04,312 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 16:47:04,313 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-10-14 16:47:04,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 16:47:04,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:04,313 INFO L204 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] [2024-10-14 16:47:04,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-10-14 16:47:04,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1835992455, now seen corresponding path program 1 times [2024-10-14 16:47:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693767484] [2024-10-14 16:47:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:04,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:47:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:47:04,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:47:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693767484] [2024-10-14 16:47:04,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693767484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:47:04,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:47:04,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 16:47:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875617235] [2024-10-14 16:47:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:47:04,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 16:47:04,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:47:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 16:47:04,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:47:04,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 418 [2024-10-14 16:47:04,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 418 transitions, 854 flow. Second operand has 2 states, 2 states have (on average 339.0) internal successors, (678), 2 states have internal predecessors, (678), 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) [2024-10-14 16:47:04,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:47:04,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 418 [2024-10-14 16:47:04,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:47:06,161 INFO L124 PetriNetUnfolderBase]: 1750/12194 cut-off events. [2024-10-14 16:47:06,161 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2024-10-14 16:47:06,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14667 conditions, 12194 events. 1750/12194 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 137529 event pairs, 962 based on Foata normal form. 959/11570 useless extension candidates. Maximal degree in co-relation 12831. Up to 2202 conditions per place. [2024-10-14 16:47:06,269 INFO L140 encePairwiseOnDemand]: 365/418 looper letters, 27 selfloop transitions, 0 changer transitions 0/359 dead transitions. [2024-10-14 16:47:06,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 359 transitions, 790 flow [2024-10-14 16:47:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 16:47:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-14 16:47:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 756 transitions. [2024-10-14 16:47:06,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9043062200956937 [2024-10-14 16:47:06,272 INFO L175 Difference]: Start difference. First operand has 406 places, 418 transitions, 854 flow. Second operand 2 states and 756 transitions. [2024-10-14 16:47:06,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 359 transitions, 790 flow [2024-10-14 16:47:06,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 359 transitions, 788 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-14 16:47:06,277 INFO L231 Difference]: Finished difference. Result has 355 places, 359 transitions, 734 flow [2024-10-14 16:47:06,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=734, PETRI_PLACES=355, PETRI_TRANSITIONS=359} [2024-10-14 16:47:06,278 INFO L277 CegarLoopForPetriNet]: 406 programPoint places, -51 predicate places. [2024-10-14 16:47:06,278 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 359 transitions, 734 flow [2024-10-14 16:47:06,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 339.0) internal successors, (678), 2 states have internal predecessors, (678), 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) [2024-10-14 16:47:06,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:06,279 INFO L204 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] [2024-10-14 16:47:06,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 16:47:06,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-10-14 16:47:06,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash -842752918, now seen corresponding path program 1 times [2024-10-14 16:47:06,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:06,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849624450] [2024-10-14 16:47:06,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:06,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:47:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:47:06,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:47:06,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849624450] [2024-10-14 16:47:06,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849624450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:47:06,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:47:06,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:47:06,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104132567] [2024-10-14 16:47:06,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:47:06,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:47:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:47:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:47:06,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:47:06,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 418 [2024-10-14 16:47:06,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 359 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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) [2024-10-14 16:47:06,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:47:06,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 418 [2024-10-14 16:47:06,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:47:13,666 INFO L124 PetriNetUnfolderBase]: 9392/55987 cut-off events. [2024-10-14 16:47:13,666 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2024-10-14 16:47:13,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69194 conditions, 55987 events. 9392/55987 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 828200 event pairs, 2763 based on Foata normal form. 0/48498 useless extension candidates. Maximal degree in co-relation 69188. Up to 6318 conditions per place. [2024-10-14 16:47:14,182 INFO L140 encePairwiseOnDemand]: 406/418 looper letters, 65 selfloop transitions, 9 changer transitions 0/394 dead transitions. [2024-10-14 16:47:14,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 394 transitions, 962 flow [2024-10-14 16:47:14,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:47:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:47:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1055 transitions. [2024-10-14 16:47:14,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8413078149920256 [2024-10-14 16:47:14,186 INFO L175 Difference]: Start difference. First operand has 355 places, 359 transitions, 734 flow. Second operand 3 states and 1055 transitions. [2024-10-14 16:47:14,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 394 transitions, 962 flow [2024-10-14 16:47:14,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 394 transitions, 962 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 16:47:14,194 INFO L231 Difference]: Finished difference. Result has 359 places, 368 transitions, 812 flow [2024-10-14 16:47:14,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=359, PETRI_TRANSITIONS=368} [2024-10-14 16:47:14,195 INFO L277 CegarLoopForPetriNet]: 406 programPoint places, -47 predicate places. [2024-10-14 16:47:14,196 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 368 transitions, 812 flow [2024-10-14 16:47:14,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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) [2024-10-14 16:47:14,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:14,197 INFO L204 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] [2024-10-14 16:47:14,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 16:47:14,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-10-14 16:47:14,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1172496393, now seen corresponding path program 1 times [2024-10-14 16:47:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360787694] [2024-10-14 16:47:14,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:14,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:47:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:47:14,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:47:14,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360787694] [2024-10-14 16:47:14,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360787694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:47:14,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:47:14,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:47:14,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745382682] [2024-10-14 16:47:14,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:47:14,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:47:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:47:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:47:14,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:47:14,262 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 418 [2024-10-14 16:47:14,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 368 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 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) [2024-10-14 16:47:14,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:47:14,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 418 [2024-10-14 16:47:14,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:47:15,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [115#L766-3true, 298#L775-6true, 407#true, 411#true, 405#true, 403#true, 91#L766-3true, 416#true, 371#L716true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:15,940 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-10-14 16:47:15,940 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-10-14 16:47:15,940 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2024-10-14 16:47:15,940 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-10-14 16:47:16,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [115#L766-3true, 298#L775-6true, 407#true, 411#true, 405#true, 403#true, 294#L764true, 91#L766-3true, 416#true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:16,003 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2024-10-14 16:47:16,003 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2024-10-14 16:47:16,003 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-10-14 16:47:16,003 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2024-10-14 16:47:17,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 411#true, 405#true, 403#true, 91#L766-3true, 416#true, 371#L716true, 409#true, 155#L705-3true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:17,992 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2024-10-14 16:47:17,992 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-10-14 16:47:17,992 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-14 16:47:17,993 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-10-14 16:47:18,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 411#true, 405#true, 403#true, 294#L764true, 91#L766-3true, 416#true, 409#true, 155#L705-3true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:18,168 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2024-10-14 16:47:18,168 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-10-14 16:47:18,168 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-10-14 16:47:18,168 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-10-14 16:47:18,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [322#L707-3true, 298#L775-6true, 407#true, 411#true, 405#true, 403#true, 91#L766-3true, 416#true, 371#L716true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:18,715 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-10-14 16:47:18,715 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-14 16:47:18,715 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-14 16:47:18,715 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-14 16:47:18,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [322#L707-3true, 298#L775-6true, 407#true, 411#true, 405#true, 403#true, 294#L764true, 416#true, 91#L766-3true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:18,913 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2024-10-14 16:47:18,913 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-10-14 16:47:18,914 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-10-14 16:47:18,914 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2024-10-14 16:47:21,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 411#true, 405#true, 403#true, 91#L766-3true, 416#true, 318#L732-3true, 371#L716true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:21,909 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-14 16:47:21,909 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:21,909 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:21,909 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-14 16:47:22,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 411#true, 405#true, 403#true, 294#L764true, 416#true, 91#L766-3true, 318#L732-3true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:22,007 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-10-14 16:47:22,007 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 16:47:22,007 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-10-14 16:47:22,007 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-10-14 16:47:22,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 411#true, 405#true, 403#true, 91#L766-3true, 416#true, 371#L716true, 239#L733true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:22,013 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-10-14 16:47:22,013 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 16:47:22,013 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-10-14 16:47:22,013 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-10-14 16:47:22,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 411#true, 405#true, 403#true, 294#L764true, 416#true, 91#L766-3true, 239#L733true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:22,115 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-10-14 16:47:22,115 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 16:47:22,116 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-14 16:47:22,116 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-14 16:47:23,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 411#true, 405#true, 403#true, 416#true, 91#L766-3true, 371#L716true, 348#L735-3true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:23,219 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-14 16:47:23,219 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 16:47:23,219 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-14 16:47:23,219 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-14 16:47:23,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 411#true, 405#true, 403#true, 294#L764true, 416#true, 91#L766-3true, 348#L735-3true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:23,477 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-14 16:47:23,477 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 16:47:23,477 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 16:47:23,477 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 16:47:23,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 162#L736-3true, 411#true, 405#true, 403#true, 91#L766-3true, 416#true, 371#L716true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:23,701 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-14 16:47:23,701 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-14 16:47:23,701 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-14 16:47:23,701 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-10-14 16:47:23,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1591] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_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_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_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_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, 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][125], [298#L775-6true, 407#true, 162#L736-3true, 411#true, 405#true, 403#true, 294#L764true, 91#L766-3true, 416#true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:23,798 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 16:47:23,798 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 16:47:23,798 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-14 16:47:23,798 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-14 16:47:27,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1847] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, #memory_int=|v_#memory_int_424|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][78], [115#L766-3true, 298#L775-6true, 407#true, 83#L735-3true, 411#true, 405#true, 403#true, 416#true, 93#L752-3true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:27,743 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-10-14 16:47:27,743 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2024-10-14 16:47:27,743 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 16:47:27,743 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 16:47:27,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1847] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, #memory_int=|v_#memory_int_424|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][78], [115#L766-3true, 298#L775-6true, 407#true, 411#true, 405#true, 403#true, 416#true, 93#L752-3true, 48#L736-3true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:27,867 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2024-10-14 16:47:27,867 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-14 16:47:27,867 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-14 16:47:27,867 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-14 16:47:29,277 INFO L124 PetriNetUnfolderBase]: 21169/100349 cut-off events. [2024-10-14 16:47:29,277 INFO L125 PetriNetUnfolderBase]: For 1890/1890 co-relation queries the response was YES. [2024-10-14 16:47:29,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131912 conditions, 100349 events. 21169/100349 cut-off events. For 1890/1890 co-relation queries the response was YES. Maximal size of possible extension queue 1692. Compared 1554755 event pairs, 10174 based on Foata normal form. 0/87003 useless extension candidates. Maximal degree in co-relation 131904. Up to 26122 conditions per place. [2024-10-14 16:47:30,703 INFO L140 encePairwiseOnDemand]: 406/418 looper letters, 57 selfloop transitions, 11 changer transitions 0/394 dead transitions. [2024-10-14 16:47:30,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 394 transitions, 1010 flow [2024-10-14 16:47:30,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 16:47:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 16:47:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2024-10-14 16:47:30,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8277511961722488 [2024-10-14 16:47:30,707 INFO L175 Difference]: Start difference. First operand has 359 places, 368 transitions, 812 flow. Second operand 3 states and 1038 transitions. [2024-10-14 16:47:30,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 394 transitions, 1010 flow [2024-10-14 16:47:30,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 394 transitions, 992 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 16:47:30,740 INFO L231 Difference]: Finished difference. Result has 361 places, 378 transitions, 880 flow [2024-10-14 16:47:30,741 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=361, PETRI_TRANSITIONS=378} [2024-10-14 16:47:30,744 INFO L277 CegarLoopForPetriNet]: 406 programPoint places, -45 predicate places. [2024-10-14 16:47:30,745 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 378 transitions, 880 flow [2024-10-14 16:47:30,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 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) [2024-10-14 16:47:30,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 16:47:30,745 INFO L204 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] [2024-10-14 16:47:30,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 16:47:30,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2024-10-14 16:47:30,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:47:30,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1080482932, now seen corresponding path program 1 times [2024-10-14 16:47:30,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:47:30,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407314497] [2024-10-14 16:47:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:47:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:47:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:47:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:47:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:47:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407314497] [2024-10-14 16:47:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407314497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:47:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:47:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:47:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837906360] [2024-10-14 16:47:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:47:30,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 16:47:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:47:30,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 16:47:30,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 16:47:30,837 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 418 [2024-10-14 16:47:30,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 378 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 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) [2024-10-14 16:47:30,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 16:47:30,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 418 [2024-10-14 16:47:30,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 16:47:34,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][336], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 6#L717-3true, 421#true, 416#true, 409#true, Black: 411#true, 188#L717-3true, 10#L752-3true]) [2024-10-14 16:47:34,446 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-10-14 16:47:34,446 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-10-14 16:47:34,446 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-10-14 16:47:34,446 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-10-14 16:47:34,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][336], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 6#L717-3true, 366#L717-4true, 416#true, 409#true, Black: 411#true, 10#L752-3true]) [2024-10-14 16:47:34,620 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-10-14 16:47:34,620 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:34,620 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:34,621 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:34,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][336], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 6#L717-3true, 47#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 421#true, 416#true, 409#true, Black: 411#true, 10#L752-3true]) [2024-10-14 16:47:34,621 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-10-14 16:47:34,621 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:34,622 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:34,625 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:35,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][360], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 6#L717-3true, 421#true, 416#true, 409#true, Black: 411#true, 188#L717-3true, 10#L752-3true]) [2024-10-14 16:47:35,575 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is not cut-off event [2024-10-14 16:47:35,575 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2024-10-14 16:47:35,575 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-10-14 16:47:35,575 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2024-10-14 16:47:35,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][336], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 6#L717-3true, 421#true, 416#true, 371#L716true, 409#true, Black: 411#true, 10#L752-3true]) [2024-10-14 16:47:35,698 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2024-10-14 16:47:35,698 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-10-14 16:47:35,698 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-14 16:47:35,698 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-10-14 16:47:35,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][360], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 6#L717-3true, 421#true, 416#true, 366#L717-4true, 409#true, Black: 411#true, 10#L752-3true]) [2024-10-14 16:47:35,699 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2024-10-14 16:47:35,699 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2024-10-14 16:47:35,699 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-10-14 16:47:35,699 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-10-14 16:47:36,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][374], [115#L766-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 416#true, 371#L716true, 93#L752-3true, 409#true, Black: 411#true]) [2024-10-14 16:47:36,333 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-10-14 16:47:36,333 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:36,334 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:36,334 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:36,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][399], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 6#L717-3true, 416#true, 423#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), 409#true, 163#L766-3true, Black: 411#true, 10#L752-3true]) [2024-10-14 16:47:36,803 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-10-14 16:47:36,803 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-14 16:47:36,803 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:36,803 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:36,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][399], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 6#L717-3true, 423#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), 416#true, 409#true, Black: 411#true, 232#L762-3true, 10#L752-3true]) [2024-10-14 16:47:36,803 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-10-14 16:47:36,804 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-14 16:47:36,804 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-14 16:47:36,804 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-14 16:47:37,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][336], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 416#true, 91#L766-3true, 371#L716true, 409#true, Black: 411#true, 10#L752-3true]) [2024-10-14 16:47:37,674 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-10-14 16:47:37,674 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:37,674 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:37,674 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:37,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][336], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 6#L717-3true, 416#true, 409#true, Black: 411#true, 178#L760true, 10#L752-3true]) [2024-10-14 16:47:37,880 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2024-10-14 16:47:37,880 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-14 16:47:37,880 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2024-10-14 16:47:37,880 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-14 16:47:38,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][374], [4#L717-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 47#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 416#true, 93#L752-3true, 409#true, Black: 411#true]) [2024-10-14 16:47:38,014 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-14 16:47:38,014 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:38,014 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-14 16:47:38,014 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-14 16:47:38,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][374], [4#L717-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 416#true, 93#L752-3true, 409#true, Black: 411#true, 188#L717-3true]) [2024-10-14 16:47:38,015 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-10-14 16:47:38,015 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-10-14 16:47:38,015 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-14 16:47:38,015 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2024-10-14 16:47:38,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][374], [4#L717-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 416#true, 371#L716true, 93#L752-3true, 409#true, Black: 411#true]) [2024-10-14 16:47:38,126 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-10-14 16:47:38,126 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 16:47:38,126 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-10-14 16:47:38,126 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-10-14 16:47:38,127 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][374], [115#L766-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 416#true, 371#L716true, 93#L752-3true, 409#true, Black: 411#true]) [2024-10-14 16:47:38,127 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-14 16:47:38,127 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:38,127 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:38,127 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-14 16:47:38,127 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:38,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][410], [4#L717-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 423#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), 416#true, 93#L752-3true, 409#true, 232#L762-3true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:38,137 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-10-14 16:47:38,137 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-14 16:47:38,137 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-14 16:47:38,137 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-14 16:47:38,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][410], [4#L717-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 423#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), 416#true, 93#L752-3true, 409#true, 163#L766-3true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:38,137 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-10-14 16:47:38,137 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-14 16:47:38,137 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:38,137 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:38,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][410], [4#L717-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 244#L764-3true, 423#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), 416#true, 93#L752-3true, 409#true, Black: 413#(= |#race~state~0| 0)]) [2024-10-14 16:47:38,138 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2024-10-14 16:47:38,138 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-14 16:47:38,138 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-10-14 16:47:38,138 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-10-14 16:47:38,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][374], [4#L717-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 416#true, 366#L717-4true, 93#L752-3true, 409#true, Black: 411#true]) [2024-10-14 16:47:38,371 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-14 16:47:38,371 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-14 16:47:38,371 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-14 16:47:38,371 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:38,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][410], [4#L717-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 423#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), 416#true, 93#L752-3true, 409#true, 163#L766-3true, Black: 411#true]) [2024-10-14 16:47:38,552 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-10-14 16:47:38,552 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:38,552 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-14 16:47:38,552 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:38,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][410], [4#L717-3true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 423#(= |#race~state~0| |thr1Thread1of3ForFork0_#t~nondet18#1|), 416#true, 93#L752-3true, 409#true, Black: 411#true, 232#L762-3true]) [2024-10-14 16:47:38,553 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-10-14 16:47:38,553 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-14 16:47:38,553 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-10-14 16:47:38,553 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-10-14 16:47:38,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][336], [338#L762true, Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 416#true, 371#L716true, 409#true, Black: 411#true, 10#L752-3true]) [2024-10-14 16:47:38,576 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-10-14 16:47:38,576 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-10-14 16:47:38,576 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-10-14 16:47:38,576 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-10-14 16:47:38,577 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][336], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 416#true, 91#L766-3true, 371#L716true, 409#true, Black: 411#true, 10#L752-3true]) [2024-10-14 16:47:38,577 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2024-10-14 16:47:38,577 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-10-14 16:47:38,577 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-10-14 16:47:38,578 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:38,578 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2024-10-14 16:47:39,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1937] L752-->L752-3: Formula: (let ((.cse3 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|)) (.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|))) (and (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|) (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|) (= |v_#race~top~0_30| |v_#race~top~0_29|)) (and (let ((.cse0 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 0) (not .cse0)) (and (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| 1) .cse0))) (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483648)) (let ((.cse2 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 0))) (or (and .cse1 (not .cse2)) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108| .cse2))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88| 2147483647) (= |v_#race~top~0_29| 0) .cse3 (= |v_thr1Thread2of3ForFork0_isEmpty_#res#1_4| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|))) (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109| .cse4) (and (not .cse4) .cse3))) .cse1 (= |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|))) InVars {#race~top~0=|v_#race~top~0_30|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_1|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread2of3ForFork0_push_loop_~r~0#1=|v_thr1Thread2of3ForFork0_push_loop_~r~0#1_9|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, thr1Thread2of3ForFork0_isEmpty_#res#1=|v_thr1Thread2of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~ret13#1_89|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_88|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_109|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_108|] AssignedVars[thr1Thread2of3ForFork0___VERIFIER_atomic_assert_~r#1, #race~top~0, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread2of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread2of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, thr1Thread2of3ForFork0_isEmpty_#res#1][336], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 6#L717-3true, 421#true, 416#true, 409#true, 163#L766-3true, Black: 411#true, 10#L752-3true]) [2024-10-14 16:47:39,072 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-10-14 16:47:39,072 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-10-14 16:47:39,074 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-10-14 16:47:39,074 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-10-14 16:47:39,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1681] L752-->L752-3: Formula: (let ((.cse1 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|)) (.cse2 (not |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|))) (and (or (and (let ((.cse0 (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 0))) (or (and .cse0 |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (and .cse1 (not .cse0)))) (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|) .cse2 (<= 0 (+ |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483648)) (= |v_#race~top~0_29| 0) (let ((.cse3 (= v_~top~0_19 0))) (or (and (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 0) (not .cse3)) (and .cse3 (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| 1)))) (<= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80| 2147483647)) (and (= |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81| |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|) (= |v_thr1Thread3of3ForFork0_isEmpty_#res#1_4| |v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|) |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| (= |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|) (= |v_#race~top~0_30| |v_#race~top~0_29|))) (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|) .cse1 (= |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2| |v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|) (let ((.cse4 (= |v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9| 0))) (or (and (not .cse4) .cse2) (and |v_thr1___VERIFIER_atomic_assert_#t~short14#1_101| .cse4))))) InVars {thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_1|, #race~top~0=|v_#race~top~0_30|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_1|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_3|} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base_2|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1_3|, #race~top~0=|v_#race~top~0_29|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1_3|, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset_2|, thr1Thread3of3ForFork0_push_loop_~r~0#1=|v_thr1Thread3of3ForFork0_push_loop_~r~0#1_9|, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1_3|, ~top~0=v_~top~0_19, thr1Thread3of3ForFork0_isEmpty_#res#1=|v_thr1Thread3of3ForFork0_isEmpty_#res#1_4|} AuxVars[|v_thr1___VERIFIER_atomic_assert_#t~short14#1_101|, |v_thr1___VERIFIER_atomic_assert_#t~short14#1_100|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_81|, |v_thr1___VERIFIER_atomic_assert_#t~ret13#1_80|] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~short14#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#t~ret13#1, #race~top~0, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_~r#1, thr1Thread3of3ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_assert_#in~r#1, thr1Thread3of3ForFork0_isEmpty_#res#1][374], [Black: 418#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet8#1|), 298#L775-6true, 407#true, 403#true, 405#true, 421#true, 416#true, 371#L716true, 93#L752-3true, 155#L705-3true, 409#true, Black: 411#true]) [2024-10-14 16:47:39,212 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-10-14 16:47:39,212 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-14 16:47:39,212 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-10-14 16:47:39,212 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event