./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 48c9605d 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-?-48c9605-m [2025-02-08 05:11:41,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:11:41,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:11:41,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:11:41,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:11:41,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:11:41,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:11:41,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:11:41,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:11:41,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:11:41,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:11:41,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:11:41,314 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:11:41,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:11:41,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:11:41,314 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:11:41,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:11:41,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:11:41,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:11:41,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:11:41,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:11:41,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:41,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:11:41,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:11:41,316 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:11:41,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:11:41,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:11:41,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:11:41,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:11:41,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:11:41,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:11:41,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:11:41,317 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-02-08 05:11:41,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:11:41,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:11:41,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:11:41,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:11:41,572 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:11:41,573 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-02-08 05:11:42,702 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3149f2c5d/d86c674dac0a43f98ad4c5da32c832a9/FLAGa107e9b6a [2025-02-08 05:11:43,039 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:11:43,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2-race.i [2025-02-08 05:11:43,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3149f2c5d/d86c674dac0a43f98ad4c5da32c832a9/FLAGa107e9b6a [2025-02-08 05:11:43,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3149f2c5d/d86c674dac0a43f98ad4c5da32c832a9 [2025-02-08 05:11:43,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:11:43,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:11:43,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:43,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:11:43,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:11:43,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517e2800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43, skipping insertion in model container [2025-02-08 05:11:43,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:11:43,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:43,356 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:11:43,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:43,440 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:11:43,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43 WrapperNode [2025-02-08 05:11:43,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:43,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:43,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:11:43,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:11:43,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,493 INFO L138 Inliner]: procedures = 177, calls = 45, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 952 [2025-02-08 05:11:43,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:43,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:11:43,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:11:43,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:11:43,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:11:43,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:11:43,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:11:43,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:11:43,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:43,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:11:43,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:11:43,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:11:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:11:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:11:43,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:11:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:11:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:11:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:11:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:11:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:11:43,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:11:43,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:11:43,587 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:11:43,715 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:11:43,716 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:11:44,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume #race~memory~0[push_~newTop~0#1] == push_#t~nondet15#1; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume !(#race~memory~0[push_~newTop~0#1] == push_#t~nondet15#1); [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: havoc push_#t~nondet15#1; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: #race~memory~0 := #race~memory~0[push_~newTop~0#1 := push_#t~nondet15#1]; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-3: havoc push_#t~nondet15#1; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: ~memory~0 := ~memory~0[push_~newTop~0#1 := push_~d#1]; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747: assume true; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747: assume !true; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: havoc push_#t~mem16#1; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: assume ((0 == #race[~#top~0.base,~#top~0.offset] && 0 == #race[~#top~0.base,1 + ~#top~0.offset]) && 0 == #race[~#top~0.base,2 + ~#top~0.offset]) && 0 == #race[~#top~0.base,3 + ~#top~0.offset]; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: assume !(((0 == #race[~#top~0.base,~#top~0.offset] && 0 == #race[~#top~0.base,1 + ~#top~0.offset]) && 0 == #race[~#top~0.base,2 + ~#top~0.offset]) && 0 == #race[~#top~0.base,3 + ~#top~0.offset]); [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: push_~oldTop~0#1 := push_#t~mem16#1; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-3: #race := #race[~#top~0.base,3 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-4: #race := #race[~#top~0.base,2 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-5: #race := #race[~#top~0.base,1 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-6: #race := #race[~#top~0.base,~#top~0.offset := 0]; [2025-02-08 05:11:44,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-7: SUMMARY for call push_#t~mem16#1 := read~int(~#top~0.base, ~#top~0.offset, 4); srcloc: null [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765: havoc push_loop_#t~ret22#1; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765-1: push_loop_~r~0#1 := push_loop_#t~ret22#1; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765-2: assume { :end_inline_push } true;assume -2147483648 <= push_loop_#t~ret22#1 && push_loop_#t~ret22#1 <= 2147483647; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765-3: havoc push_#in~d#1; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L699-1: __VERIFIER_atomic_CAS_~u#1 := __VERIFIER_atomic_CAS_#in~u#1; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765-4: havoc push_#t~ret14#1, push_#t~nondet15#1, push_#t~mem16#1, push_#t~nondet17#1, push_#t~mem18#1, push_~d#1, push_~oldTop~0#1, push_~newTop~0#1, push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L699-2: __VERIFIER_atomic_CAS_~e#1 := __VERIFIER_atomic_CAS_#in~e#1; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765-5: push_loop_#t~ret22#1 := push_#res#1; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L699-3: __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume #race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet17#1; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume !(#race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet17#1); [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: havoc push_#t~nondet17#1; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-2: #race~memory~0 := #race~memory~0[1 + push_~newTop~0#1 := push_#t~nondet17#1]; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-3: havoc push_#t~nondet17#1; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-4: ~memory~0 := ~memory~0[1 + push_~newTop~0#1 := push_~oldTop~0#1]; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L766: [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L766-1: havoc __VERIFIER_atomic_assert_#in~r#1;assume { :end_inline___VERIFIER_atomic_assert } true; [2025-02-08 05:11:44,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L766-2: havoc __VERIFIER_atomic_assert_#t~ret19#1, __VERIFIER_atomic_assert_#t~short20#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:44,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L766-3: havoc __VERIFIER_atomic_assert_#t~ret19#1, __VERIFIER_atomic_assert_#t~short20#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:44,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L766-4: assume { :begin_inline___VERIFIER_atomic_assert } true;__VERIFIER_atomic_assert_#in~r#1 := push_loop_~r~0#1; [2025-02-08 05:11:44,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: [2025-02-08 05:11:44,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: havoc __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset;assume { :end_inline___VERIFIER_atomic_CAS } true; [2025-02-08 05:11:44,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-2: havoc __VERIFIER_atomic_CAS_#t~mem7#1, __VERIFIER_atomic_CAS_#t~nondet8#1, __VERIFIER_atomic_CAS_#t~nondet9#1, __VERIFIER_atomic_CAS_#t~nondet10#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 05:11:44,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-3: havoc __VERIFIER_atomic_CAS_#t~mem7#1, __VERIFIER_atomic_CAS_#t~nondet8#1, __VERIFIER_atomic_CAS_#t~nondet9#1, __VERIFIER_atomic_CAS_#t~nondet10#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 05:11:44,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-4: assume { :begin_inline___VERIFIER_atomic_CAS } true;__VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset := ~#top~0.base, ~#top~0.offset, push_~oldTop~0#1, push_~newTop~0#1, push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: assume 1 == push_#t~mem18#1; [2025-02-08 05:11:44,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: assume !(1 == push_#t~mem18#1); [2025-02-08 05:11:44,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: havoc push_#t~mem18#1; [2025-02-08 05:11:44,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: havoc push_#t~mem18#1; [2025-02-08 05:11:44,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-3: assume ((0 == #race[push_~#casret~0#1.base,push_~#casret~0#1.offset] && 0 == #race[push_~#casret~0#1.base,1 + push_~#casret~0#1.offset]) && 0 == #race[push_~#casret~0#1.base,2 + push_~#casret~0#1.offset]) && 0 == #race[push_~#casret~0#1.base,3 + push_~#casret~0#1.offset]; [2025-02-08 05:11:44,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-3: assume !(((0 == #race[push_~#casret~0#1.base,push_~#casret~0#1.offset] && 0 == #race[push_~#casret~0#1.base,1 + push_~#casret~0#1.offset]) && 0 == #race[push_~#casret~0#1.base,2 + push_~#casret~0#1.offset]) && 0 == #race[push_~#casret~0#1.base,3 + push_~#casret~0#1.offset]); [2025-02-08 05:11:44,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-4: #race := #race[push_~#casret~0#1.base,3 + push_~#casret~0#1.offset := 0]; [2025-02-08 05:11:44,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-5: #race := #race[push_~#casret~0#1.base,2 + push_~#casret~0#1.offset := 0]; [2025-02-08 05:11:44,204 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-6: #race := #race[push_~#casret~0#1.base,1 + push_~#casret~0#1.offset := 0]; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-7: #race := #race[push_~#casret~0#1.base,push_~#casret~0#1.offset := 0]; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-8: SUMMARY for call push_#t~mem18#1 := read~int(push_~#casret~0#1.base, push_~#casret~0#1.offset, 4); srcloc: null [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume 0 == isEmpty_#t~mem13#1; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume !(0 == isEmpty_#t~mem13#1); [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-1: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-2: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-3: assume ((0 == #race[~#top~0.base,~#top~0.offset] && 0 == #race[~#top~0.base,1 + ~#top~0.offset]) && 0 == #race[~#top~0.base,2 + ~#top~0.offset]) && 0 == #race[~#top~0.base,3 + ~#top~0.offset]; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-3: assume !(((0 == #race[~#top~0.base,~#top~0.offset] && 0 == #race[~#top~0.base,1 + ~#top~0.offset]) && 0 == #race[~#top~0.base,2 + ~#top~0.offset]) && 0 == #race[~#top~0.base,3 + ~#top~0.offset]); [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-4: #race := #race[~#top~0.base,3 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-5: #race := #race[~#top~0.base,2 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-6: #race := #race[~#top~0.base,1 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-7: #race := #race[~#top~0.base,~#top~0.offset := 0]; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-8: SUMMARY for call isEmpty_#t~mem13#1 := read~int(~#top~0.base, ~#top~0.offset, 4); srcloc: null [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-1: push_#res#1 := 1; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: isEmpty_#res#1 := 1; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L738-1: isEmpty_#res#1 := 0; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: assume __VERIFIER_atomic_CAS_#t~mem7#1 == __VERIFIER_atomic_CAS_~e#1; [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: assume !(__VERIFIER_atomic_CAS_#t~mem7#1 == __VERIFIER_atomic_CAS_~e#1); [2025-02-08 05:11:44,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-1: havoc __VERIFIER_atomic_CAS_#t~mem7#1; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-2: havoc __VERIFIER_atomic_CAS_#t~mem7#1; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-3: assume ((0 == #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset]; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-3: assume !(((0 == #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset]); [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-4: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-5: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-6: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-7: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-8: SUMMARY for call __VERIFIER_atomic_CAS_#t~mem7#1 := read~int(__VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: assume ((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: assume !(((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1); [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-2: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-3: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-4: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-5: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-6: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-7: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-8: SUMMARY for call write~int(1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-9: assume ((#race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1 && #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-9: assume !(((#race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1 && #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1); [2025-02-08 05:11:44,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-10: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:11:44,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-11: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:11:44,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-12: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:11:44,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-13: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:11:44,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L757: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-14: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-15: SUMMARY for call write~int(__VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L741-1: SUMMARY for call ULTIMATE.dealloc(push_~#casret~0#1.base, push_~#casret~0#1.offset); srcloc: null [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L741-2: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L741-3: SUMMARY for call ULTIMATE.dealloc(push_~#casret~0#1.base, push_~#casret~0#1.offset); srcloc: null [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L741-4: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L741-5: SUMMARY for call ULTIMATE.dealloc(push_~#casret~0#1.base, push_~#casret~0#1.offset); srcloc: null [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: havoc push_#t~ret14#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: push_~newTop~0#1 := push_#t~ret14#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume { :end_inline_index_malloc } true;assume -2147483648 <= push_#t~ret14#1 && push_#t~ret14#1 <= 2147483647; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-3: havoc index_malloc_#t~nondet11#1, index_malloc_~curr_alloc_idx~0#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: push_#t~ret14#1 := index_malloc_#res#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-3: havoc __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-4: havoc __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-5: assume !__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-5: assume !!__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-6: havoc __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-7: havoc __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-8: __VERIFIER_atomic_assert_#t~short20#1 := 0 == __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-9: assume { :end_inline_isEmpty } true;assume -2147483648 <= __VERIFIER_atomic_assert_#t~ret19#1 && __VERIFIER_atomic_assert_#t~ret19#1 <= 2147483647; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-10: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-11: __VERIFIER_atomic_assert_#t~ret19#1 := isEmpty_#res#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-12: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-13: assume __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-13: assume !__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-14: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-15: __VERIFIER_atomic_assert_#t~short20#1 := 0 == __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: assume 0 == push_~newTop~0#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: assume !(0 == push_~newTop~0#1); [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: assume ((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: assume !(((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1); [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: push_#res#1 := 0; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: havoc __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-2: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet10#1]; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-3: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet10#1]; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-4: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet10#1]; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-5: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet10#1]; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-6: havoc __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:44,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-7: SUMMARY for call write~int(0, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 05:11:44,628 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:11:44,628 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:11:44,823 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:11:44,824 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:11:44,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:44 BoogieIcfgContainer [2025-02-08 05:11:44,824 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:11:44,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:11:44,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:11:44,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:11:44,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:11:43" (1/3) ... [2025-02-08 05:11:44,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d42301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:44, skipping insertion in model container [2025-02-08 05:11:44,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (2/3) ... [2025-02-08 05:11:44,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d42301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:44, skipping insertion in model container [2025-02-08 05:11:44,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:44" (3/3) ... [2025-02-08 05:11:44,831 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-2-race.i [2025-02-08 05:11:44,840 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:11:44,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-2-race.i that has 2 procedures, 756 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-02-08 05:11:44,842 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:11:44,942 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:44,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 759 places, 758 transitions, 1520 flow [2025-02-08 05:11:45,206 INFO L124 PetriNetUnfolderBase]: 2/765 cut-off events. [2025-02-08 05:11:45,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:45,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 765 events. 2/765 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 164 event pairs, 0 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2025-02-08 05:11:45,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 759 places, 758 transitions, 1520 flow [2025-02-08 05:11:45,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 759 places, 758 transitions, 1520 flow [2025-02-08 05:11:45,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:45,229 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;@33244db3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:45,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:11:45,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:45,318 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-08 05:11:45,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:45,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:45,319 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-02-08 05:11:45,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:45,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1096111208, now seen corresponding path program 1 times [2025-02-08 05:11:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75176372] [2025-02-08 05:11:45,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:45,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:45,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:45,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:45,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:47,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-02-08 05:11:47,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:47,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75176372] [2025-02-08 05:11:47,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75176372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:47,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:47,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:47,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933137990] [2025-02-08 05:11:47,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:47,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:47,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:47,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:47,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 758 [2025-02-08 05:11:47,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 758 transitions, 1520 flow. Second operand has 2 states, 2 states have (on average 741.0) internal successors, (1482), 2 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:47,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:47,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 758 [2025-02-08 05:11:47,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:48,090 INFO L124 PetriNetUnfolderBase]: 2/745 cut-off events. [2025-02-08 05:11:48,091 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:48,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 745 events. 2/745 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 6/741 useless extension candidates. Maximal degree in co-relation 84. Up to 7 conditions per place. [2025-02-08 05:11:48,095 INFO L140 encePairwiseOnDemand]: 746/758 looper letters, 6 selfloop transitions, 0 changer transitions 0/742 dead transitions. [2025-02-08 05:11:48,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 742 transitions, 1500 flow [2025-02-08 05:11:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1498 transitions. [2025-02-08 05:11:48,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9881266490765171 [2025-02-08 05:11:48,113 INFO L175 Difference]: Start difference. First operand has 759 places, 758 transitions, 1520 flow. Second operand 2 states and 1498 transitions. [2025-02-08 05:11:48,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 744 places, 742 transitions, 1500 flow [2025-02-08 05:11:48,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 742 transitions, 1500 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:48,133 INFO L231 Difference]: Finished difference. Result has 744 places, 742 transitions, 1488 flow [2025-02-08 05:11:48,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=758, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1488, PETRI_PLACES=744, PETRI_TRANSITIONS=742} [2025-02-08 05:11:48,138 INFO L279 CegarLoopForPetriNet]: 759 programPoint places, -15 predicate places. [2025-02-08 05:11:48,138 INFO L471 AbstractCegarLoop]: Abstraction has has 744 places, 742 transitions, 1488 flow [2025-02-08 05:11:48,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 741.0) internal successors, (1482), 2 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:48,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:48,139 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-02-08 05:11:48,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:11:48,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:48,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1095818692, now seen corresponding path program 1 times [2025-02-08 05:11:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:48,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518738691] [2025-02-08 05:11:48,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:48,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:48,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:48,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:48,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:48,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:48,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:48,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518738691] [2025-02-08 05:11:48,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518738691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:48,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:48,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:48,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803722985] [2025-02-08 05:11:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:48,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:48,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:48,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:48,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:48,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 758 [2025-02-08 05:11:48,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 742 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:48,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:48,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 758 [2025-02-08 05:11:48,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:48,930 INFO L124 PetriNetUnfolderBase]: 2/794 cut-off events. [2025-02-08 05:11:48,930 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:48,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 794 events. 2/794 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 202 event pairs, 0 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 809. Up to 8 conditions per place. [2025-02-08 05:11:48,935 INFO L140 encePairwiseOnDemand]: 755/758 looper letters, 11 selfloop transitions, 2 changer transitions 0/745 dead transitions. [2025-02-08 05:11:48,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 745 transitions, 1520 flow [2025-02-08 05:11:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2222 transitions. [2025-02-08 05:11:48,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9771328056288479 [2025-02-08 05:11:48,942 INFO L175 Difference]: Start difference. First operand has 744 places, 742 transitions, 1488 flow. Second operand 3 states and 2222 transitions. [2025-02-08 05:11:48,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 745 transitions, 1520 flow [2025-02-08 05:11:48,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 745 places, 745 transitions, 1520 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:48,956 INFO L231 Difference]: Finished difference. Result has 745 places, 741 transitions, 1490 flow [2025-02-08 05:11:48,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=758, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=745, PETRI_TRANSITIONS=741} [2025-02-08 05:11:48,959 INFO L279 CegarLoopForPetriNet]: 759 programPoint places, -14 predicate places. [2025-02-08 05:11:48,959 INFO L471 AbstractCegarLoop]: Abstraction has has 745 places, 741 transitions, 1490 flow [2025-02-08 05:11:48,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:48,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:48,961 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-02-08 05:11:48,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:11:48,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:48,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1751074309, now seen corresponding path program 1 times [2025-02-08 05:11:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:48,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116045126] [2025-02-08 05:11:48,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:49,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-08 05:11:49,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-08 05:11:49,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:49,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:49,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:49,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-08 05:11:49,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-08 05:11:49,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:49,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:49,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:49,441 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:49,441 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2025-02-08 05:11:49,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:11:49,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-02-08 05:11:49,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:11:49,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:11:49,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:11:49,445 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:49,447 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:49,447 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:11:49,508 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:49,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 846 places, 845 transitions, 1700 flow [2025-02-08 05:11:49,717 INFO L124 PetriNetUnfolderBase]: 4/861 cut-off events. [2025-02-08 05:11:49,717 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:11:49,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 861 events. 4/861 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 619 event pairs, 0 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 766. Up to 3 conditions per place. [2025-02-08 05:11:49,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 846 places, 845 transitions, 1700 flow [2025-02-08 05:11:49,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 846 places, 845 transitions, 1700 flow [2025-02-08 05:11:49,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:49,726 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;@33244db3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:49,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 05:11:49,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:49,807 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-02-08 05:11:49,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:49,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:49,808 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-02-08 05:11:49,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:49,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:49,811 INFO L85 PathProgramCache]: Analyzing trace with hash -387519653, now seen corresponding path program 1 times [2025-02-08 05:11:49,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:49,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902252069] [2025-02-08 05:11:49,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:49,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:50,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:50,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:50,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:51,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902252069] [2025-02-08 05:11:51,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902252069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:51,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:51,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:51,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802834014] [2025-02-08 05:11:51,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:51,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:51,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:51,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:51,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:51,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 810 out of 845 [2025-02-08 05:11:51,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 846 places, 845 transitions, 1700 flow. Second operand has 2 states, 2 states have (on average 811.0) internal successors, (1622), 2 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:51,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:51,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 810 of 845 [2025-02-08 05:11:51,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:51,532 INFO L124 PetriNetUnfolderBase]: 38/1256 cut-off events. [2025-02-08 05:11:51,532 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:11:51,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 1256 events. 38/1256 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3135 event pairs, 23 based on Foata normal form. 46/1220 useless extension candidates. Maximal degree in co-relation 752. Up to 66 conditions per place. [2025-02-08 05:11:51,538 INFO L140 encePairwiseOnDemand]: 822/845 looper letters, 12 selfloop transitions, 0 changer transitions 0/817 dead transitions. [2025-02-08 05:11:51,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 817 transitions, 1668 flow [2025-02-08 05:11:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1655 transitions. [2025-02-08 05:11:51,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9792899408284024 [2025-02-08 05:11:51,542 INFO L175 Difference]: Start difference. First operand has 846 places, 845 transitions, 1700 flow. Second operand 2 states and 1655 transitions. [2025-02-08 05:11:51,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 819 places, 817 transitions, 1668 flow [2025-02-08 05:11:51,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 819 places, 817 transitions, 1668 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:51,551 INFO L231 Difference]: Finished difference. Result has 819 places, 817 transitions, 1644 flow [2025-02-08 05:11:51,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=845, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=818, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1644, PETRI_PLACES=819, PETRI_TRANSITIONS=817} [2025-02-08 05:11:51,553 INFO L279 CegarLoopForPetriNet]: 846 programPoint places, -27 predicate places. [2025-02-08 05:11:51,553 INFO L471 AbstractCegarLoop]: Abstraction has has 819 places, 817 transitions, 1644 flow [2025-02-08 05:11:51,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 811.0) internal successors, (1622), 2 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:51,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:51,555 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-02-08 05:11:51,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:11:51,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:51,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1255862687, now seen corresponding path program 1 times [2025-02-08 05:11:51,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:51,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886133602] [2025-02-08 05:11:51,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:51,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:51,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:51,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:51,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886133602] [2025-02-08 05:11:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886133602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:51,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840338723] [2025-02-08 05:11:51,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:51,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:51,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:51,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:51,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:51,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 802 out of 845 [2025-02-08 05:11:51,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 819 places, 817 transitions, 1644 flow. Second operand has 3 states, 3 states have (on average 803.3333333333334) internal successors, (2410), 3 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:51,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:51,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 802 of 845 [2025-02-08 05:11:51,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:52,344 INFO L124 PetriNetUnfolderBase]: 151/2444 cut-off events. [2025-02-08 05:11:52,345 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:11:52,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 2444 events. 151/2444 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 14369 event pairs, 48 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 2768. Up to 146 conditions per place. [2025-02-08 05:11:52,363 INFO L140 encePairwiseOnDemand]: 837/845 looper letters, 31 selfloop transitions, 6 changer transitions 0/834 dead transitions. [2025-02-08 05:11:52,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 834 transitions, 1757 flow [2025-02-08 05:11:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2445 transitions. [2025-02-08 05:11:52,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644970414201184 [2025-02-08 05:11:52,368 INFO L175 Difference]: Start difference. First operand has 819 places, 817 transitions, 1644 flow. Second operand 3 states and 2445 transitions. [2025-02-08 05:11:52,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 834 transitions, 1757 flow [2025-02-08 05:11:52,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 834 transitions, 1757 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:52,383 INFO L231 Difference]: Finished difference. Result has 823 places, 823 transitions, 1696 flow [2025-02-08 05:11:52,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=845, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1696, PETRI_PLACES=823, PETRI_TRANSITIONS=823} [2025-02-08 05:11:52,387 INFO L279 CegarLoopForPetriNet]: 846 programPoint places, -23 predicate places. [2025-02-08 05:11:52,387 INFO L471 AbstractCegarLoop]: Abstraction has has 823 places, 823 transitions, 1696 flow [2025-02-08 05:11:52,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 803.3333333333334) internal successors, (2410), 3 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:52,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:52,389 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-02-08 05:11:52,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:11:52,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:52,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1481194724, now seen corresponding path program 1 times [2025-02-08 05:11:52,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:52,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741849267] [2025-02-08 05:11:52,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:52,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-08 05:11:52,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-08 05:11:52,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:52,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:52,599 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:52,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-08 05:11:52,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-08 05:11:52,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:52,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:52,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:52,814 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:52,815 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 52 remaining) [2025-02-08 05:11:52,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2025-02-08 05:11:52,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2025-02-08 05:11:52,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2025-02-08 05:11:52,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2025-02-08 05:11:52,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2025-02-08 05:11:52,815 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2025-02-08 05:11:52,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2025-02-08 05:11:52,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2025-02-08 05:11:52,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2025-02-08 05:11:52,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2025-02-08 05:11:52,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2025-02-08 05:11:52,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2025-02-08 05:11:52,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2025-02-08 05:11:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2025-02-08 05:11:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2025-02-08 05:11:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2025-02-08 05:11:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2025-02-08 05:11:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2025-02-08 05:11:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2025-02-08 05:11:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2025-02-08 05:11:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2025-02-08 05:11:52,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2025-02-08 05:11:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2025-02-08 05:11:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2025-02-08 05:11:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2025-02-08 05:11:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2025-02-08 05:11:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2025-02-08 05:11:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2025-02-08 05:11:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2025-02-08 05:11:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2025-02-08 05:11:52,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2025-02-08 05:11:52,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining) [2025-02-08 05:11:52,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining) [2025-02-08 05:11:52,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2025-02-08 05:11:52,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2025-02-08 05:11:52,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2025-02-08 05:11:52,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2025-02-08 05:11:52,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2025-02-08 05:11:52,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:11:52,821 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:52,821 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:52,821 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:11:52,912 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:52,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 933 places, 932 transitions, 1882 flow [2025-02-08 05:11:53,049 INFO L124 PetriNetUnfolderBase]: 6/957 cut-off events. [2025-02-08 05:11:53,049 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:11:53,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 957 events. 6/957 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1190 event pairs, 0 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 865. Up to 4 conditions per place. [2025-02-08 05:11:53,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 933 places, 932 transitions, 1882 flow [2025-02-08 05:11:53,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 933 places, 932 transitions, 1882 flow [2025-02-08 05:11:53,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:53,067 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;@33244db3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:53,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:11:53,191 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:53,191 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-08 05:11:53,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:53,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:53,192 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-02-08 05:11:53,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:53,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash 881964885, now seen corresponding path program 1 times [2025-02-08 05:11:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:53,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352238795] [2025-02-08 05:11:53,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:53,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:53,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:53,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:53,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:54,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:54,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352238795] [2025-02-08 05:11:54,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352238795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:54,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:54,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:54,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091797221] [2025-02-08 05:11:54,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:54,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:54,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:54,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:54,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:54,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 880 out of 932 [2025-02-08 05:11:54,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 932 transitions, 1882 flow. Second operand has 2 states, 2 states have (on average 881.0) internal successors, (1762), 2 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:54,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:54,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 880 of 932 [2025-02-08 05:11:54,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:54,978 INFO L124 PetriNetUnfolderBase]: 392/4351 cut-off events. [2025-02-08 05:11:54,978 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 05:11:54,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5049 conditions, 4351 events. 392/4351 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 34657 event pairs, 294 based on Foata normal form. 306/4145 useless extension candidates. Maximal degree in co-relation 3534. Up to 561 conditions per place. [2025-02-08 05:11:55,016 INFO L140 encePairwiseOnDemand]: 898/932 looper letters, 18 selfloop transitions, 0 changer transitions 0/892 dead transitions. [2025-02-08 05:11:55,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 892 transitions, 1838 flow [2025-02-08 05:11:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1812 transitions. [2025-02-08 05:11:55,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9721030042918455 [2025-02-08 05:11:55,019 INFO L175 Difference]: Start difference. First operand has 933 places, 932 transitions, 1882 flow. Second operand 2 states and 1812 transitions. [2025-02-08 05:11:55,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 894 places, 892 transitions, 1838 flow [2025-02-08 05:11:55,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 892 transitions, 1836 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:55,028 INFO L231 Difference]: Finished difference. Result has 894 places, 892 transitions, 1800 flow [2025-02-08 05:11:55,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=932, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=893, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1800, PETRI_PLACES=894, PETRI_TRANSITIONS=892} [2025-02-08 05:11:55,030 INFO L279 CegarLoopForPetriNet]: 933 programPoint places, -39 predicate places. [2025-02-08 05:11:55,030 INFO L471 AbstractCegarLoop]: Abstraction has has 894 places, 892 transitions, 1800 flow [2025-02-08 05:11:55,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 881.0) internal successors, (1762), 2 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:55,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:55,031 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-02-08 05:11:55,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:11:55,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:55,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1459821465, now seen corresponding path program 1 times [2025-02-08 05:11:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419420720] [2025-02-08 05:11:55,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:55,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:55,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:55,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:55,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:55,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419420720] [2025-02-08 05:11:55,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419420720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:55,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:55,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:55,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431218810] [2025-02-08 05:11:55,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:55,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:55,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:55,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:55,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 868 out of 932 [2025-02-08 05:11:55,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 894 places, 892 transitions, 1800 flow. Second operand has 3 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:55,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:55,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 868 of 932 [2025-02-08 05:11:55,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:59,579 INFO L124 PetriNetUnfolderBase]: 3227/21631 cut-off events. [2025-02-08 05:11:59,580 INFO L125 PetriNetUnfolderBase]: For 418/418 co-relation queries the response was YES. [2025-02-08 05:11:59,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26890 conditions, 21631 events. 3227/21631 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 279289 event pairs, 1134 based on Foata normal form. 0/18718 useless extension candidates. Maximal degree in co-relation 26884. Up to 2458 conditions per place. [2025-02-08 05:11:59,919 INFO L140 encePairwiseOnDemand]: 920/932 looper letters, 47 selfloop transitions, 9 changer transitions 0/918 dead transitions. [2025-02-08 05:11:59,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 896 places, 918 transitions, 1974 flow [2025-02-08 05:11:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2663 transitions. [2025-02-08 05:11:59,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9524320457796852 [2025-02-08 05:11:59,925 INFO L175 Difference]: Start difference. First operand has 894 places, 892 transitions, 1800 flow. Second operand 3 states and 2663 transitions. [2025-02-08 05:11:59,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 896 places, 918 transitions, 1974 flow [2025-02-08 05:11:59,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 896 places, 918 transitions, 1974 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:59,938 INFO L231 Difference]: Finished difference. Result has 898 places, 901 transitions, 1878 flow [2025-02-08 05:11:59,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=932, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=894, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1878, PETRI_PLACES=898, PETRI_TRANSITIONS=901} [2025-02-08 05:11:59,941 INFO L279 CegarLoopForPetriNet]: 933 programPoint places, -35 predicate places. [2025-02-08 05:11:59,942 INFO L471 AbstractCegarLoop]: Abstraction has has 898 places, 901 transitions, 1878 flow [2025-02-08 05:11:59,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:59,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:59,943 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-02-08 05:11:59,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:11:59,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:59,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1899197977, now seen corresponding path program 1 times [2025-02-08 05:11:59,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:59,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633003908] [2025-02-08 05:11:59,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:59,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:00,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-02-08 05:12:00,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-02-08 05:12:00,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:00,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:02,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633003908] [2025-02-08 05:12:02,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633003908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:02,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:02,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881890549] [2025-02-08 05:12:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:02,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:02,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:02,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 859 out of 932 [2025-02-08 05:12:02,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 898 places, 901 transitions, 1878 flow. Second operand has 6 states, 6 states have (on average 860.6666666666666) internal successors, (5164), 6 states have internal predecessors, (5164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:02,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:02,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 859 of 932 [2025-02-08 05:12:02,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:06,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 775#L781-1true, 599#L789-2true, 651#L732-1true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:06,207 INFO L294 olderBase$Statistics]: this new event has 723 ancestors and is cut-off event [2025-02-08 05:12:06,207 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-08 05:12:06,208 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-08 05:12:06,208 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-08 05:12:06,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 408#L777-1true, 932#true, 610#L781-1true, 775#L781-1true, 599#L789-2true, 930#true, 940#(= |#race~state~0| 0), Black: 938#true, 943#true]) [2025-02-08 05:12:06,396 INFO L294 olderBase$Statistics]: this new event has 724 ancestors and is cut-off event [2025-02-08 05:12:06,397 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:12:06,397 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-08 05:12:06,397 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-08 05:12:06,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 775#L781-1true, 292#L777true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:06,626 INFO L294 olderBase$Statistics]: this new event has 725 ancestors and is cut-off event [2025-02-08 05:12:06,626 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-08 05:12:06,626 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-08 05:12:06,626 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:12:07,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 320#L732-3true, 151#L778-2true, 930#true, 940#(= |#race~state~0| 0), Black: 938#true, 943#true]) [2025-02-08 05:12:07,690 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-02-08 05:12:07,690 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:12:07,690 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:12:07,690 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:12:07,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 211#L732-2true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 151#L778-2true, 930#true, 940#(= |#race~state~0| 0), Black: 938#true, 943#true]) [2025-02-08 05:12:07,848 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-02-08 05:12:07,848 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:12:07,848 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:12:07,848 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:12:08,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 151#L778-2true, 930#true, 940#(= |#race~state~0| 0), Black: 938#true, 943#true, 375#L732true]) [2025-02-08 05:12:08,104 INFO L294 olderBase$Statistics]: this new event has 732 ancestors and is cut-off event [2025-02-08 05:12:08,104 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-08 05:12:08,104 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-08 05:12:08,104 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-08 05:12:08,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 715#L732-1true, 151#L778-2true, 930#true, 940#(= |#race~state~0| 0), Black: 938#true, 943#true]) [2025-02-08 05:12:08,251 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-02-08 05:12:08,251 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-08 05:12:08,251 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-08 05:12:08,251 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-08 05:12:08,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 57#L721-2true, 932#true, 610#L781-1true, 599#L789-2true, 411#L732-4true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:08,925 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-02-08 05:12:08,925 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-08 05:12:08,925 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-08 05:12:08,925 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-08 05:12:09,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 57#L721-2true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 189#L732-3true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:09,287 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-02-08 05:12:09,287 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:12:09,287 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-02-08 05:12:09,287 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:12:09,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 57#L721-2true, 934#true, 701#L732-2true, 932#true, 610#L781-1true, 599#L789-2true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:09,613 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-02-08 05:12:09,613 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:12:09,613 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-02-08 05:12:09,613 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:12:09,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 57#L721-2true, 932#true, 610#L781-1true, 599#L789-2true, 551#L732true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:09,849 INFO L294 olderBase$Statistics]: this new event has 740 ancestors and is cut-off event [2025-02-08 05:12:09,850 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-08 05:12:09,850 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-08 05:12:09,850 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-02-08 05:12:10,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 57#L721-2true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 651#L732-1true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,110 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:10,110 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:10,110 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:10,110 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:10,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 57#L721-2true, 932#true, 610#L781-1true, 599#L789-2true, 651#L732-1true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,111 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:10,111 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:10,111 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:10,111 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:10,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 57#L721-2true, 932#true, 610#L781-1true, 599#L789-2true, 712#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,112 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:10,112 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:10,112 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:10,112 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:10,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 411#L732-4true, 581#L723true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,117 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:10,117 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:10,117 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:10,117 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:10,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 408#L777-1true, 57#L721-2true, 932#true, 610#L781-1true, 599#L789-2true, 930#true, 940#(= |#race~state~0| 0), Black: 938#true, 943#true]) [2025-02-08 05:12:10,311 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-08 05:12:10,311 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-08 05:12:10,311 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:10,311 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:10,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 189#L732-3true, 581#L723true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,315 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-08 05:12:10,315 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-08 05:12:10,315 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:10,315 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:10,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 57#L721-2true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 292#L777true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,635 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-08 05:12:10,635 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:12:10,635 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:10,635 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:10,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 701#L732-2true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 581#L723true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,637 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-08 05:12:10,637 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:10,637 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:10,637 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:12:10,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 551#L732true, 599#L789-2true, 581#L723true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,783 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-02-08 05:12:10,783 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-02-08 05:12:10,783 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-02-08 05:12:10,783 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-02-08 05:12:10,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 651#L732-1true, 581#L723true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,935 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,935 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,935 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,935 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 651#L732-1true, 581#L723true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,936 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,936 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,936 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,936 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 712#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 581#L723true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,937 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,937 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,937 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,937 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:11,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 408#L777-1true, 932#true, 610#L781-1true, 599#L789-2true, 581#L723true, 930#true, 940#(= |#race~state~0| 0), Black: 938#true, 943#true]) [2025-02-08 05:12:11,073 INFO L294 olderBase$Statistics]: this new event has 746 ancestors and is cut-off event [2025-02-08 05:12:11,073 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:12:11,073 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:12:11,073 INFO L297 olderBase$Statistics]: existing Event has 746 ancestors and is cut-off event [2025-02-08 05:12:11,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 292#L777true, 581#L723true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:11,207 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-02-08 05:12:11,207 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:12:11,207 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:12:11,207 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-02-08 05:12:12,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3752] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_617| |v_~#m2~0.base_23|)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3)) (.cse0 (select .cse1 .cse4))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_619| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_619| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_617|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= .cse0 (select .cse1 .cse5)) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0)))) InVars {#race=|v_#race_619|, #memory_int=|v_#memory_int_189|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_617|, 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_188|, ~#m2~0.base=|v_~#m2~0.base_23|, 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_23|, 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], [936#true, 934#true, 932#true, 610#L781-1true, 599#L789-2true, 712#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 420#L729-1true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 943#true]) [2025-02-08 05:12:12,319 INFO L294 olderBase$Statistics]: this new event has 755 ancestors and is cut-off event [2025-02-08 05:12:12,319 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2025-02-08 05:12:12,319 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,319 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:13,506 INFO L124 PetriNetUnfolderBase]: 13850/59070 cut-off events. [2025-02-08 05:12:13,506 INFO L125 PetriNetUnfolderBase]: For 1961/1966 co-relation queries the response was YES. [2025-02-08 05:12:13,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83290 conditions, 59070 events. 13850/59070 cut-off events. For 1961/1966 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 854605 event pairs, 5973 based on Foata normal form. 0/51604 useless extension candidates. Maximal degree in co-relation 83282. Up to 16407 conditions per place. [2025-02-08 05:12:14,137 INFO L140 encePairwiseOnDemand]: 905/932 looper letters, 72 selfloop transitions, 78 changer transitions 0/1012 dead transitions. [2025-02-08 05:12:14,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 1012 transitions, 2440 flow [2025-02-08 05:12:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:12:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:12:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5305 transitions. [2025-02-08 05:12:14,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486766809728183 [2025-02-08 05:12:14,147 INFO L175 Difference]: Start difference. First operand has 898 places, 901 transitions, 1878 flow. Second operand 6 states and 5305 transitions. [2025-02-08 05:12:14,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 1012 transitions, 2440 flow [2025-02-08 05:12:14,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 1012 transitions, 2422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:12:14,176 INFO L231 Difference]: Finished difference. Result has 905 places, 982 transitions, 2344 flow [2025-02-08 05:12:14,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=932, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2344, PETRI_PLACES=905, PETRI_TRANSITIONS=982} [2025-02-08 05:12:14,178 INFO L279 CegarLoopForPetriNet]: 933 programPoint places, -28 predicate places. [2025-02-08 05:12:14,178 INFO L471 AbstractCegarLoop]: Abstraction has has 905 places, 982 transitions, 2344 flow [2025-02-08 05:12:14,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 860.6666666666666) internal successors, (5164), 6 states have internal predecessors, (5164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:14,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:14,181 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:14,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:12:14,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:12:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1318252263, now seen corresponding path program 1 times [2025-02-08 05:12:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85493031] [2025-02-08 05:12:14,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:14,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-08 05:12:14,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-08 05:12:14,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:14,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:14,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:14,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-08 05:12:14,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-08 05:12:14,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:14,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:14,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:14,476 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:14,476 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:12:14,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:12:14,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:12:14,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:12:14,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:12:14,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:12:14,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:12:14,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:12:14,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:12:14,480 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:12:14,480 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:14,480 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:12:14,558 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:14,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1020 places, 1019 transitions, 2066 flow [2025-02-08 05:12:14,708 INFO L124 PetriNetUnfolderBase]: 8/1053 cut-off events. [2025-02-08 05:12:14,708 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:12:14,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 1053 events. 8/1053 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1790 event pairs, 0 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 965. Up to 5 conditions per place. [2025-02-08 05:12:14,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 1020 places, 1019 transitions, 2066 flow [2025-02-08 05:12:14,723 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1020 places, 1019 transitions, 2066 flow [2025-02-08 05:12:14,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:14,724 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;@33244db3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:14,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 05:12:14,761 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:14,761 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-08 05:12:14,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:12:14,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:14,762 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-02-08 05:12:14,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2025-02-08 05:12:14,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1582619386, now seen corresponding path program 1 times [2025-02-08 05:12:14,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:14,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380704246] [2025-02-08 05:12:14,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:14,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:15,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:12:15,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:12:15,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:15,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:16,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380704246] [2025-02-08 05:12:16,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380704246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:16,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:16,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:12:16,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658876466] [2025-02-08 05:12:16,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:16,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:12:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:16,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:12:16,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:12:16,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 950 out of 1019 [2025-02-08 05:12:16,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1019 transitions, 2066 flow. Second operand has 2 states, 2 states have (on average 951.0) internal successors, (1902), 2 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:16,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:16,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 950 of 1019 [2025-02-08 05:12:16,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:21,648 INFO L124 PetriNetUnfolderBase]: 3368/23452 cut-off events. [2025-02-08 05:12:21,648 INFO L125 PetriNetUnfolderBase]: For 1926/1926 co-relation queries the response was YES. [2025-02-08 05:12:21,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28848 conditions, 23452 events. 3368/23452 cut-off events. For 1926/1926 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 301667 event pairs, 2768 based on Foata normal form. 2032/22414 useless extension candidates. Maximal degree in co-relation 22590. Up to 4393 conditions per place. [2025-02-08 05:12:21,862 INFO L140 encePairwiseOnDemand]: 974/1019 looper letters, 24 selfloop transitions, 0 changer transitions 0/967 dead transitions. [2025-02-08 05:12:21,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 967 transitions, 2010 flow [2025-02-08 05:12:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:12:21,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:12:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1969 transitions. [2025-02-08 05:12:21,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661432777232581 [2025-02-08 05:12:21,869 INFO L175 Difference]: Start difference. First operand has 1020 places, 1019 transitions, 2066 flow. Second operand 2 states and 1969 transitions. [2025-02-08 05:12:21,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 967 transitions, 2010 flow [2025-02-08 05:12:21,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 969 places, 967 transitions, 2004 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:21,891 INFO L231 Difference]: Finished difference. Result has 969 places, 967 transitions, 1956 flow [2025-02-08 05:12:21,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1019, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=967, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1956, PETRI_PLACES=969, PETRI_TRANSITIONS=967} [2025-02-08 05:12:21,896 INFO L279 CegarLoopForPetriNet]: 1020 programPoint places, -51 predicate places. [2025-02-08 05:12:21,896 INFO L471 AbstractCegarLoop]: Abstraction has has 969 places, 967 transitions, 1956 flow [2025-02-08 05:12:21,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 951.0) internal successors, (1902), 2 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:21,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:21,897 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-02-08 05:12:21,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:12:21,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2025-02-08 05:12:21,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash -478647510, now seen corresponding path program 1 times [2025-02-08 05:12:21,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:21,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010196507] [2025-02-08 05:12:21,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:21,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:21,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:12:21,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:12:21,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:21,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:22,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010196507] [2025-02-08 05:12:22,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010196507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:22,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:22,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:12:22,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294294037] [2025-02-08 05:12:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:22,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:12:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:22,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:12:22,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:12:22,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 934 out of 1019 [2025-02-08 05:12:22,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 969 places, 967 transitions, 1956 flow. Second operand has 3 states, 3 states have (on average 935.3333333333334) internal successors, (2806), 3 states have internal predecessors, (2806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:22,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:22,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 934 of 1019 [2025-02-08 05:12:22,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand