./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cb8c1938cc441082517c5681097f5f6483a36107a8ec46d723b101297930909d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:05:55,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:05:55,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:05:55,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:05:55,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:05:55,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:05:55,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:05:55,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:05:55,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:05:55,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:05:55,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:05:55,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:05:55,128 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:05:55,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:05:55,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:05:55,129 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:05:55,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:05:55,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:05:55,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:05:55,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:05:55,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:05:55,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:05:55,130 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:05:55,130 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:05:55,130 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:05:55,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:05:55,130 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:05:55,130 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:05:55,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:05:55,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:05:55,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:05:55,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:05:55,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:05:55,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:05:55,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:05:55,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:05:55,132 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb8c1938cc441082517c5681097f5f6483a36107a8ec46d723b101297930909d [2025-01-09 21:05:55,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:05:55,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:05:55,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:05:55,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:05:55,434 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:05:55,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2-race.i [2025-01-09 21:05:56,775 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c97aee0b5/0c676a377c2b4ac3899ae8c3140d19f8/FLAG794b8a927 [2025-01-09 21:05:57,135 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:05:57,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2-race.i [2025-01-09 21:05:57,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c97aee0b5/0c676a377c2b4ac3899ae8c3140d19f8/FLAG794b8a927 [2025-01-09 21:05:57,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c97aee0b5/0c676a377c2b4ac3899ae8c3140d19f8 [2025-01-09 21:05:57,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:05:57,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:05:57,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:05:57,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:05:57,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:05:57,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7cae7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57, skipping insertion in model container [2025-01-09 21:05:57,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:05:57,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:05:57,629 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:05:57,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:05:57,739 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:05:57,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57 WrapperNode [2025-01-09 21:05:57,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:05:57,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:05:57,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:05:57,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:05:57,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,816 INFO L138 Inliner]: procedures = 177, calls = 45, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 952 [2025-01-09 21:05:57,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:05:57,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:05:57,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:05:57,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:05:57,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:05:57,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:05:57,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:05:57,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:05:57,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (1/1) ... [2025-01-09 21:05:57,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:05:57,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:05:57,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:05:57,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:05:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:05:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:05:57,969 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:05:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:05:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:05:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:05:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:05:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:05:57,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:05:57,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:05:57,972 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:05:58,097 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:05:58,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:05:59,181 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:05:59,181 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:05:59,556 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:05:59,557 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:05:59,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:59 BoogieIcfgContainer [2025-01-09 21:05:59,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:05:59,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:05:59,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:05:59,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:05:59,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:05:57" (1/3) ... [2025-01-09 21:05:59,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0e823b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:59, skipping insertion in model container [2025-01-09 21:05:59,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:57" (2/3) ... [2025-01-09 21:05:59,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0e823b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:59, skipping insertion in model container [2025-01-09 21:05:59,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:59" (3/3) ... [2025-01-09 21:05:59,567 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-2-race.i [2025-01-09 21:05:59,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:05:59,586 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-2-race.i that has 2 procedures, 812 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-01-09 21:05:59,586 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:05:59,714 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:05:59,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 815 places, 819 transitions, 1642 flow [2025-01-09 21:06:00,105 INFO L124 PetriNetUnfolderBase]: 7/826 cut-off events. [2025-01-09 21:06:00,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:06:00,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 826 events. 7/826 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs, 0 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 156. Up to 3 conditions per place. [2025-01-09 21:06:00,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 815 places, 819 transitions, 1642 flow [2025-01-09 21:06:00,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 815 places, 819 transitions, 1642 flow [2025-01-09 21:06:00,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:06:00,154 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;@6161bc31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:06:00,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-01-09 21:06:00,256 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:06:00,257 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-01-09 21:06:00,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:06:00,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:00,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:00,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:06:00,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1865089574, now seen corresponding path program 1 times [2025-01-09 21:06:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:00,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139208957] [2025-01-09 21:06:00,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:00,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:00,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 21:06:00,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 21:06:00,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:00,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139208957] [2025-01-09 21:06:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139208957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:03,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:03,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:06:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326812056] [2025-01-09 21:06:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:03,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:06:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:03,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:06:03,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:06:03,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 793 out of 819 [2025-01-09 21:06:03,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 815 places, 819 transitions, 1642 flow. Second operand has 2 states, 2 states have (on average 794.0) internal successors, (1588), 2 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:03,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:03,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 819 [2025-01-09 21:06:03,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:04,106 INFO L124 PetriNetUnfolderBase]: 5/798 cut-off events. [2025-01-09 21:06:04,109 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:06:04,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 798 events. 5/798 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 149 event pairs, 0 based on Foata normal form. 8/790 useless extension candidates. Maximal degree in co-relation 139. Up to 9 conditions per place. [2025-01-09 21:06:04,112 INFO L140 encePairwiseOnDemand]: 801/819 looper letters, 8 selfloop transitions, 0 changer transitions 0/795 dead transitions. [2025-01-09 21:06:04,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 794 places, 795 transitions, 1610 flow [2025-01-09 21:06:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:06:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:06:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1612 transitions. [2025-01-09 21:06:04,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9841269841269841 [2025-01-09 21:06:04,136 INFO L175 Difference]: Start difference. First operand has 815 places, 819 transitions, 1642 flow. Second operand 2 states and 1612 transitions. [2025-01-09 21:06:04,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 794 places, 795 transitions, 1610 flow [2025-01-09 21:06:04,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 794 places, 795 transitions, 1610 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:04,162 INFO L231 Difference]: Finished difference. Result has 794 places, 795 transitions, 1594 flow [2025-01-09 21:06:04,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=819, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=793, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1594, PETRI_PLACES=794, PETRI_TRANSITIONS=795} [2025-01-09 21:06:04,168 INFO L279 CegarLoopForPetriNet]: 815 programPoint places, -21 predicate places. [2025-01-09 21:06:04,169 INFO L471 AbstractCegarLoop]: Abstraction has has 794 places, 795 transitions, 1594 flow [2025-01-09 21:06:04,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 794.0) internal successors, (1588), 2 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:04,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:04,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:06:04,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:06:04,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1349646627, now seen corresponding path program 1 times [2025-01-09 21:06:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:04,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324348382] [2025-01-09 21:06:04,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:04,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 21:06:04,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 21:06:04,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:04,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:04,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:04,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324348382] [2025-01-09 21:06:04,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324348382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:04,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:06:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626320811] [2025-01-09 21:06:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:04,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:06:04,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:04,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:06:04,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:06:04,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 789 out of 819 [2025-01-09 21:06:04,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 794 places, 795 transitions, 1594 flow. Second operand has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:04,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:04,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 789 of 819 [2025-01-09 21:06:04,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:05,220 INFO L124 PetriNetUnfolderBase]: 8/900 cut-off events. [2025-01-09 21:06:05,220 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:06:05,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 900 events. 8/900 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 919. Up to 10 conditions per place. [2025-01-09 21:06:05,225 INFO L140 encePairwiseOnDemand]: 816/819 looper letters, 15 selfloop transitions, 2 changer transitions 0/800 dead transitions. [2025-01-09 21:06:05,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 795 places, 800 transitions, 1638 flow [2025-01-09 21:06:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:06:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:06:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2385 transitions. [2025-01-09 21:06:05,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9706959706959707 [2025-01-09 21:06:05,235 INFO L175 Difference]: Start difference. First operand has 794 places, 795 transitions, 1594 flow. Second operand 3 states and 2385 transitions. [2025-01-09 21:06:05,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 795 places, 800 transitions, 1638 flow [2025-01-09 21:06:05,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 795 places, 800 transitions, 1638 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:05,249 INFO L231 Difference]: Finished difference. Result has 795 places, 794 transitions, 1596 flow [2025-01-09 21:06:05,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=819, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=793, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1596, PETRI_PLACES=795, PETRI_TRANSITIONS=794} [2025-01-09 21:06:05,250 INFO L279 CegarLoopForPetriNet]: 815 programPoint places, -20 predicate places. [2025-01-09 21:06:05,251 INFO L471 AbstractCegarLoop]: Abstraction has has 795 places, 794 transitions, 1596 flow [2025-01-09 21:06:05,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:05,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:05,253 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:05,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:06:05,253 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)] === [2025-01-09 21:06:05,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:05,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1620206528, now seen corresponding path program 1 times [2025-01-09 21:06:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:05,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141068555] [2025-01-09 21:06:05,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:05,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 21:06:05,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 21:06:05,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:05,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:06:05,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:06:05,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 21:06:05,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 21:06:05,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:05,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:06:05,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:06:05,902 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:06:05,903 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-01-09 21:06:05,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-01-09 21:06:05,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-01-09 21:06:05,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-01-09 21:06:05,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-01-09 21:06:05,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-01-09 21:06:05,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-01-09 21:06:05,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-01-09 21:06:05,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-01-09 21:06:05,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-01-09 21:06:05,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-01-09 21:06:05,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-01-09 21:06:05,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-01-09 21:06:05,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-01-09 21:06:05,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-01-09 21:06:05,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-01-09 21:06:05,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-01-09 21:06:05,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-01-09 21:06:05,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-01-09 21:06:05,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-01-09 21:06:05,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-01-09 21:06:05,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-01-09 21:06:05,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-01-09 21:06:05,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-01-09 21:06:05,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-01-09 21:06:05,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-01-09 21:06:05,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-01-09 21:06:05,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-01-09 21:06:05,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:06:05,912 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 21:06:05,915 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:06:05,915 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:06:06,040 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:06:06,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 958 places, 967 transitions, 1944 flow [2025-01-09 21:06:06,307 INFO L124 PetriNetUnfolderBase]: 14/983 cut-off events. [2025-01-09 21:06:06,307 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:06:06,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 983 events. 14/983 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 989 event pairs, 0 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 827. Up to 3 conditions per place. [2025-01-09 21:06:06,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 958 places, 967 transitions, 1944 flow [2025-01-09 21:06:06,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 958 places, 967 transitions, 1944 flow [2025-01-09 21:06:06,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:06:06,327 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;@6161bc31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:06:06,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-01-09 21:06:06,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:06:06,407 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-01-09 21:06:06,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:06:06,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:06,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:06,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:06:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1111129204, now seen corresponding path program 1 times [2025-01-09 21:06:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529402744] [2025-01-09 21:06:06,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:06,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 21:06:06,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 21:06:06,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:06,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529402744] [2025-01-09 21:06:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529402744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:08,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:08,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:06:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436377932] [2025-01-09 21:06:08,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:08,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:06:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:08,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:06:08,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:06:08,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 916 out of 967 [2025-01-09 21:06:08,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 958 places, 967 transitions, 1944 flow. Second operand has 2 states, 2 states have (on average 917.0) internal successors, (1834), 2 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:08,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:08,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 916 of 967 [2025-01-09 21:06:08,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:08,976 INFO L124 PetriNetUnfolderBase]: 101/1979 cut-off events. [2025-01-09 21:06:08,977 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:06:08,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2128 conditions, 1979 events. 101/1979 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8258 event pairs, 38 based on Foata normal form. 89/1899 useless extension candidates. Maximal degree in co-relation 1287. Up to 126 conditions per place. [2025-01-09 21:06:08,991 INFO L140 encePairwiseOnDemand]: 932/967 looper letters, 16 selfloop transitions, 0 changer transitions 0/923 dead transitions. [2025-01-09 21:06:08,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 923 transitions, 1888 flow [2025-01-09 21:06:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:06:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:06:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1883 transitions. [2025-01-09 21:06:08,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736297828335057 [2025-01-09 21:06:08,996 INFO L175 Difference]: Start difference. First operand has 958 places, 967 transitions, 1944 flow. Second operand 2 states and 1883 transitions. [2025-01-09 21:06:08,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 923 transitions, 1888 flow [2025-01-09 21:06:09,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 923 transitions, 1888 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:09,011 INFO L231 Difference]: Finished difference. Result has 919 places, 923 transitions, 1856 flow [2025-01-09 21:06:09,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=967, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=918, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1856, PETRI_PLACES=919, PETRI_TRANSITIONS=923} [2025-01-09 21:06:09,013 INFO L279 CegarLoopForPetriNet]: 958 programPoint places, -39 predicate places. [2025-01-09 21:06:09,013 INFO L471 AbstractCegarLoop]: Abstraction has has 919 places, 923 transitions, 1856 flow [2025-01-09 21:06:09,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 917.0) internal successors, (1834), 2 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:09,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:09,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:09,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:06:09,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:06:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1651584457, now seen corresponding path program 1 times [2025-01-09 21:06:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:09,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321901158] [2025-01-09 21:06:09,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:09,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 21:06:09,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 21:06:09,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:09,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:09,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:09,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321901158] [2025-01-09 21:06:09,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321901158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:09,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:09,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:06:09,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505495962] [2025-01-09 21:06:09,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:09,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:06:09,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:09,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:06:09,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:06:09,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 908 out of 967 [2025-01-09 21:06:09,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 923 transitions, 1856 flow. Second operand has 3 states, 3 states have (on average 909.3333333333334) internal successors, (2728), 3 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:09,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:09,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 908 of 967 [2025-01-09 21:06:09,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:10,592 INFO L124 PetriNetUnfolderBase]: 338/4578 cut-off events. [2025-01-09 21:06:10,593 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-01-09 21:06:10,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5094 conditions, 4578 events. 338/4578 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 35594 event pairs, 66 based on Foata normal form. 0/4092 useless extension candidates. Maximal degree in co-relation 5089. Up to 239 conditions per place. [2025-01-09 21:06:10,629 INFO L140 encePairwiseOnDemand]: 959/967 looper letters, 39 selfloop transitions, 6 changer transitions 0/944 dead transitions. [2025-01-09 21:06:10,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 944 transitions, 1993 flow [2025-01-09 21:06:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:06:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:06:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2771 transitions. [2025-01-09 21:06:10,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9551878662530162 [2025-01-09 21:06:10,639 INFO L175 Difference]: Start difference. First operand has 919 places, 923 transitions, 1856 flow. Second operand 3 states and 2771 transitions. [2025-01-09 21:06:10,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 944 transitions, 1993 flow [2025-01-09 21:06:10,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 944 transitions, 1993 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:10,657 INFO L231 Difference]: Finished difference. Result has 923 places, 929 transitions, 1908 flow [2025-01-09 21:06:10,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=967, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=923, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1908, PETRI_PLACES=923, PETRI_TRANSITIONS=929} [2025-01-09 21:06:10,661 INFO L279 CegarLoopForPetriNet]: 958 programPoint places, -35 predicate places. [2025-01-09 21:06:10,661 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 929 transitions, 1908 flow [2025-01-09 21:06:10,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 909.3333333333334) internal successors, (2728), 3 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:10,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:10,664 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:10,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:06:10,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:06:10,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:10,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1465156649, now seen corresponding path program 1 times [2025-01-09 21:06:10,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:10,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840620209] [2025-01-09 21:06:10,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:10,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:10,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-01-09 21:06:10,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-01-09 21:06:10,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:10,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:06:10,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:06:10,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-01-09 21:06:11,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-01-09 21:06:11,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:11,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:06:11,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:06:11,182 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:06:11,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2025-01-09 21:06:11,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-01-09 21:06:11,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-01-09 21:06:11,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-01-09 21:06:11,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-01-09 21:06:11,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-01-09 21:06:11,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-01-09 21:06:11,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-01-09 21:06:11,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-01-09 21:06:11,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-01-09 21:06:11,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-01-09 21:06:11,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-01-09 21:06:11,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-01-09 21:06:11,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-01-09 21:06:11,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-01-09 21:06:11,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-01-09 21:06:11,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-01-09 21:06:11,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-01-09 21:06:11,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-01-09 21:06:11,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:06:11,193 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 21:06:11,193 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:06:11,193 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:06:11,326 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:06:11,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1101 places, 1115 transitions, 2248 flow [2025-01-09 21:06:11,605 INFO L124 PetriNetUnfolderBase]: 21/1140 cut-off events. [2025-01-09 21:06:11,606 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:06:11,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 1140 events. 21/1140 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1929 event pairs, 0 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 987. Up to 4 conditions per place. [2025-01-09 21:06:11,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 1101 places, 1115 transitions, 2248 flow [2025-01-09 21:06:11,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1101 places, 1115 transitions, 2248 flow [2025-01-09 21:06:11,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:06:11,636 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;@6161bc31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:06:11,636 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-01-09 21:06:11,796 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:06:11,796 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-01-09 21:06:11,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:06:11,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:11,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:11,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-01-09 21:06:11,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1487055042, now seen corresponding path program 1 times [2025-01-09 21:06:11,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:11,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174449601] [2025-01-09 21:06:11,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:11,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 21:06:11,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 21:06:11,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:11,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:13,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174449601] [2025-01-09 21:06:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174449601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:13,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:13,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:06:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969820943] [2025-01-09 21:06:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:13,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:06:13,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:13,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:06:13,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:06:13,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1039 out of 1115 [2025-01-09 21:06:13,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1101 places, 1115 transitions, 2248 flow. Second operand has 2 states, 2 states have (on average 1040.0) internal successors, (2080), 2 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:13,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:13,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1039 of 1115 [2025-01-09 21:06:13,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:16,377 INFO L124 PetriNetUnfolderBase]: 1325/12015 cut-off events. [2025-01-09 21:06:16,377 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2025-01-09 21:06:16,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13756 conditions, 12015 events. 1325/12015 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 126570 event pairs, 624 based on Foata normal form. 917/11513 useless extension candidates. Maximal degree in co-relation 11353. Up to 1533 conditions per place. [2025-01-09 21:06:16,511 INFO L140 encePairwiseOnDemand]: 1063/1115 looper letters, 24 selfloop transitions, 0 changer transitions 0/1051 dead transitions. [2025-01-09 21:06:16,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1044 places, 1051 transitions, 2168 flow [2025-01-09 21:06:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:06:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:06:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2154 transitions. [2025-01-09 21:06:16,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659192825112107 [2025-01-09 21:06:16,518 INFO L175 Difference]: Start difference. First operand has 1101 places, 1115 transitions, 2248 flow. Second operand 2 states and 2154 transitions. [2025-01-09 21:06:16,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1044 places, 1051 transitions, 2168 flow [2025-01-09 21:06:16,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 1051 transitions, 2166 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:16,532 INFO L231 Difference]: Finished difference. Result has 1044 places, 1051 transitions, 2118 flow [2025-01-09 21:06:16,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1115, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2118, PETRI_PLACES=1044, PETRI_TRANSITIONS=1051} [2025-01-09 21:06:16,536 INFO L279 CegarLoopForPetriNet]: 1101 programPoint places, -57 predicate places. [2025-01-09 21:06:16,536 INFO L471 AbstractCegarLoop]: Abstraction has has 1044 places, 1051 transitions, 2118 flow [2025-01-09 21:06:16,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1040.0) internal successors, (2080), 2 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:16,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:16,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:16,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:06:16,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-01-09 21:06:16,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:16,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1164071323, now seen corresponding path program 1 times [2025-01-09 21:06:16,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:16,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412237238] [2025-01-09 21:06:16,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:16,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:16,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 21:06:16,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 21:06:16,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:16,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:16,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:16,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412237238] [2025-01-09 21:06:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412237238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:16,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:16,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:06:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439840014] [2025-01-09 21:06:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:16,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:06:16,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:16,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:06:16,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:06:16,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1115 [2025-01-09 21:06:16,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 1051 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:16,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:16,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1115 [2025-01-09 21:06:16,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:28,473 INFO L124 PetriNetUnfolderBase]: 7711/54983 cut-off events. [2025-01-09 21:06:28,474 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-01-09 21:06:28,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65255 conditions, 54983 events. 7711/54983 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 812426 event pairs, 2078 based on Foata normal form. 0/47968 useless extension candidates. Maximal degree in co-relation 65249. Up to 4933 conditions per place. [2025-01-09 21:06:29,084 INFO L140 encePairwiseOnDemand]: 1103/1115 looper letters, 59 selfloop transitions, 9 changer transitions 0/1083 dead transitions. [2025-01-09 21:06:29,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 1083 transitions, 2328 flow [2025-01-09 21:06:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:06:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:06:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3152 transitions. [2025-01-09 21:06:29,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423019431988042 [2025-01-09 21:06:29,093 INFO L175 Difference]: Start difference. First operand has 1044 places, 1051 transitions, 2118 flow. Second operand 3 states and 3152 transitions. [2025-01-09 21:06:29,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 1083 transitions, 2328 flow [2025-01-09 21:06:29,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1046 places, 1083 transitions, 2328 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:29,110 INFO L231 Difference]: Finished difference. Result has 1048 places, 1060 transitions, 2196 flow [2025-01-09 21:06:29,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1115, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1044, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2196, PETRI_PLACES=1048, PETRI_TRANSITIONS=1060} [2025-01-09 21:06:29,113 INFO L279 CegarLoopForPetriNet]: 1101 programPoint places, -53 predicate places. [2025-01-09 21:06:29,113 INFO L471 AbstractCegarLoop]: Abstraction has has 1048 places, 1060 transitions, 2196 flow [2025-01-09 21:06:29,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:29,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:29,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:06:29,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-01-09 21:06:29,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1293332908, now seen corresponding path program 1 times [2025-01-09 21:06:29,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794668220] [2025-01-09 21:06:29,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:29,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:29,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-01-09 21:06:29,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-01-09 21:06:29,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:31,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794668220] [2025-01-09 21:06:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794668220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:06:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102850179] [2025-01-09 21:06:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:31,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:06:31,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:31,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:06:31,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:06:31,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 991 out of 1115 [2025-01-09 21:06:31,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1048 places, 1060 transitions, 2196 flow. Second operand has 6 states, 6 states have (on average 992.6666666666666) internal successors, (5956), 6 states have internal predecessors, (5956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:31,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:31,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 991 of 1115 [2025-01-09 21:06:31,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:35,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [1100#true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 330#L780-3true, 1102#true, 703#L732-7true]) [2025-01-09 21:06:35,928 INFO L294 olderBase$Statistics]: this new event has 723 ancestors and is cut-off event [2025-01-09 21:06:35,928 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-01-09 21:06:35,928 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-01-09 21:06:35,928 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-01-09 21:06:36,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, 1098#true, Black: 1106#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 330#L780-3true, 1102#true, 710#L731true]) [2025-01-09 21:06:36,149 INFO L294 olderBase$Statistics]: this new event has 724 ancestors and is cut-off event [2025-01-09 21:06:36,150 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-01-09 21:06:36,150 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-01-09 21:06:36,150 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-01-09 21:06:36,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, 629#L778true, 1098#true, Black: 1106#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 330#L780-3true, 1102#true]) [2025-01-09 21:06:36,329 INFO L294 olderBase$Statistics]: this new event has 725 ancestors and is cut-off event [2025-01-09 21:06:36,329 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-01-09 21:06:36,329 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-01-09 21:06:36,329 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-01-09 21:06:37,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, 826#L732-4true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 95#L778-3true, 1102#true]) [2025-01-09 21:06:37,510 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-01-09 21:06:37,510 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-01-09 21:06:37,510 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-01-09 21:06:37,510 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-01-09 21:06:37,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, 231#L732-5true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 95#L778-3true, 1102#true]) [2025-01-09 21:06:37,807 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-01-09 21:06:37,807 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-01-09 21:06:37,807 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-01-09 21:06:37,807 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-01-09 21:06:38,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 886#L732-6true, 559#L780-3true, 95#L778-3true, 1102#true]) [2025-01-09 21:06:38,096 INFO L294 olderBase$Statistics]: this new event has 732 ancestors and is cut-off event [2025-01-09 21:06:38,096 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-01-09 21:06:38,096 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-01-09 21:06:38,096 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-01-09 21:06:38,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 248#L732-7true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 95#L778-3true, 1102#true]) [2025-01-09 21:06:38,445 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-01-09 21:06:38,445 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-01-09 21:06:38,445 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-01-09 21:06:38,445 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-01-09 21:06:41,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, 227#L732-3true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 742#L720-3true, 1102#true]) [2025-01-09 21:06:41,416 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-01-09 21:06:41,416 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-01-09 21:06:41,416 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-01-09 21:06:41,416 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-01-09 21:06:41,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 494#L732-4true, 192#L789-4true, 1104#true, 559#L780-3true, 742#L720-3true, 1102#true]) [2025-01-09 21:06:41,639 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-01-09 21:06:41,639 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-01-09 21:06:41,639 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-01-09 21:06:41,639 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-01-09 21:06:41,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 576#L732-5true, 192#L789-4true, 1104#true, 559#L780-3true, 742#L720-3true, 1102#true]) [2025-01-09 21:06:41,928 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-01-09 21:06:41,928 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-01-09 21:06:41,928 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-01-09 21:06:41,928 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-01-09 21:06:42,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 621#L732-6true, 1104#true, 559#L780-3true, 742#L720-3true, 1102#true]) [2025-01-09 21:06:42,207 INFO L294 olderBase$Statistics]: this new event has 740 ancestors and is cut-off event [2025-01-09 21:06:42,207 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-01-09 21:06:42,207 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-01-09 21:06:42,208 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-01-09 21:06:42,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [1100#true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 742#L720-3true, 1102#true, 703#L732-7true]) [2025-01-09 21:06:42,605 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-01-09 21:06:42,605 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-01-09 21:06:42,605 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:42,606 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:42,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 742#L720-3true, 1102#true, 703#L732-7true]) [2025-01-09 21:06:42,606 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-01-09 21:06:42,606 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:42,606 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-01-09 21:06:42,606 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:42,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 573#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 192#L789-4true, 1104#true, 559#L780-3true, 742#L720-3true, 1102#true]) [2025-01-09 21:06:42,607 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-01-09 21:06:42,607 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-01-09 21:06:42,607 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:42,607 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:42,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, 227#L732-3true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 470#L722-3true, 192#L789-4true, 1104#true, 559#L780-3true, 1102#true]) [2025-01-09 21:06:42,610 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-01-09 21:06:42,610 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-01-09 21:06:42,610 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:42,610 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:43,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, 1098#true, Black: 1106#true, 1108#(= |#race~state~0| 0), 192#L789-4true, 1104#true, 559#L780-3true, 742#L720-3true, 1102#true, 710#L731true]) [2025-01-09 21:06:43,176 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-01-09 21:06:43,176 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-01-09 21:06:43,176 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-01-09 21:06:43,176 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-01-09 21:06:43,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4272] L780-->L780-3: Formula: (let ((.cse0 (select |v_#race_831| |v_~#m2~0.base_33|)) (.cse5 (+ |v_~#m2~0.offset_33| 1))) (let ((.cse3 (+ |v_~#m2~0.offset_33| 2)) (.cse1 (+ |v_~#m2~0.offset_33| 3)) (.cse2 (select .cse0 .cse5)) (.cse4 (select |v_#memory_int_493| |v_~#m2~0.base_33|))) (and (= (select .cse0 .cse1) .cse2) (= (select .cse0 .cse3) .cse2) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_33|) 1) 1 0) 0)) (= (store |v_#race_833| |v_~#m2~0.base_33| (store (store (store (store (select |v_#race_833| |v_~#m2~0.base_33|) |v_~#m2~0.offset_33| .cse2) .cse5 .cse2) .cse3 .cse2) .cse1 .cse2)) |v_#race_831|) (= (select .cse0 |v_~#m2~0.offset_33|) .cse2) (= (store |v_#memory_int_493| |v_~#m2~0.base_33| (store .cse4 |v_~#m2~0.offset_33| 0)) |v_#memory_int_492|)))) InVars {#race=|v_#race_833|, #memory_int=|v_#memory_int_493|, ~#m2~0.base=|v_~#m2~0.base_33|, ~#m2~0.offset=|v_~#m2~0.offset_33|} OutVars{#race=|v_#race_831|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_492|, ~#m2~0.base=|v_~#m2~0.base_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_33|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [1100#true, 1111#true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 470#L722-3true, 494#L732-4true, 192#L789-4true, 1104#true, 559#L780-3true, 1102#true]) [2025-01-09 21:06:43,180 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-01-09 21:06:43,180 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-01-09 21:06:43,180 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-01-09 21:06:43,180 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event