./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas-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-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 fa97ad6141e9aa8818b694f4968e766701fe7261f516cd86f7a15e5cf1a3d14d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:11:35,180 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:11:35,232 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:35,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:11:35,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:11:35,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:11:35,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:11:35,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:11:35,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:11:35,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:11:35,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:11:35,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:11:35,255 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:11:35,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:11:35,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:11:35,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:11:35,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:11:35,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:11:35,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:11:35,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:35,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:11:35,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:11:35,257 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 -> fa97ad6141e9aa8818b694f4968e766701fe7261f516cd86f7a15e5cf1a3d14d [2025-02-08 05:11:35,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:11:35,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:11:35,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:11:35,463 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:11:35,463 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:11:35,464 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-race.i [2025-02-08 05:11:36,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a87f47270/d47ade76499041c88b6a509b33e20ce1/FLAG7cf29840b [2025-02-08 05:11:36,829 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:11:36,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas-race.i [2025-02-08 05:11:36,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a87f47270/d47ade76499041c88b6a509b33e20ce1/FLAG7cf29840b [2025-02-08 05:11:36,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a87f47270/d47ade76499041c88b6a509b33e20ce1 [2025-02-08 05:11:36,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:11:36,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:11:36,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:36,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:11:36,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:11:36,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:36" (1/1) ... [2025-02-08 05:11:36,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:36, skipping insertion in model container [2025-02-08 05:11:36,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:36" (1/1) ... [2025-02-08 05:11:36,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:11:37,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:37,074 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:11:37,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:37,145 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:11:37,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:37 WrapperNode [2025-02-08 05:11:37,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:37,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:37,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:11:37,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:11:37,151 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:37" (1/1) ... [2025-02-08 05:11:37,168 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:37" (1/1) ... [2025-02-08 05:11:37,198 INFO L138 Inliner]: procedures = 177, calls = 45, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 376 [2025-02-08 05:11:37,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:37,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:11:37,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:11:37,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:11:37,209 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:37" (1/1) ... [2025-02-08 05:11:37,209 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:37" (1/1) ... [2025-02-08 05:11:37,213 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:37" (1/1) ... [2025-02-08 05:11:37,213 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:37" (1/1) ... [2025-02-08 05:11:37,231 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:37" (1/1) ... [2025-02-08 05:11:37,235 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:37" (1/1) ... [2025-02-08 05:11:37,237 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:37" (1/1) ... [2025-02-08 05:11:37,238 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:37" (1/1) ... [2025-02-08 05:11:37,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:11:37,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:11:37,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:11:37,245 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:11:37,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:37" (1/1) ... [2025-02-08 05:11:37,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:37,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:11:37,276 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:37,279 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:37,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:11:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:11:37,297 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:11:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:11:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:11:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:11:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:11:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:11:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:11:37,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:11:37,298 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:37,412 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:11:37,413 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:11:37,826 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:37,827 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:37,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: havoc push_#t~nondet15#1; [2025-02-08 05:11:37,827 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:37,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-3: havoc push_#t~nondet15#1; [2025-02-08 05:11:37,827 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:37,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747: assume true; [2025-02-08 05:11:37,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747: assume !true; [2025-02-08 05:11:37,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: havoc push_#t~mem16#1; [2025-02-08 05:11:37,827 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:37,827 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:37,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: push_~oldTop~0#1 := push_#t~mem16#1; [2025-02-08 05:11:37,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-3: #race := #race[~#top~0.base,3 + ~#top~0.offset := 0]; [2025-02-08 05:11:37,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-4: #race := #race[~#top~0.base,2 + ~#top~0.offset := 0]; [2025-02-08 05:11:37,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-5: #race := #race[~#top~0.base,1 + ~#top~0.offset := 0]; [2025-02-08 05:11:37,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-6: #race := #race[~#top~0.base,~#top~0.offset := 0]; [2025-02-08 05:11:37,828 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:37,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765: havoc push_loop_#t~ret22#1; [2025-02-08 05:11:37,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765-1: push_loop_~r~0#1 := push_loop_#t~ret22#1; [2025-02-08 05:11:37,828 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:37,828 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:37,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765-3: havoc push_#in~d#1; [2025-02-08 05:11:37,828 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:37,828 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:37,828 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:37,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L765-5: push_loop_#t~ret22#1 := push_#res#1; [2025-02-08 05:11:37,829 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:37,829 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:37,829 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:37,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: havoc push_#t~nondet17#1; [2025-02-08 05:11:37,829 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:37,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-3: havoc push_#t~nondet17#1; [2025-02-08 05:11:37,829 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:37,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L766: [2025-02-08 05:11:37,829 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:37,829 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:37,829 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:37,829 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:37,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: [2025-02-08 05:11:37,829 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:37,829 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:37,829 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:37,829 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:37,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: assume 1 == push_#t~mem18#1; [2025-02-08 05:11:37,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: assume !(1 == push_#t~mem18#1); [2025-02-08 05:11:37,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: havoc push_#t~mem18#1; [2025-02-08 05:11:37,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: havoc push_#t~mem18#1; [2025-02-08 05:11:37,830 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:37,830 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:37,830 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:37,830 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:37,830 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:37,830 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:37,830 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:37,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume 0 == isEmpty_#t~mem13#1; [2025-02-08 05:11:37,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: assume !(0 == isEmpty_#t~mem13#1); [2025-02-08 05:11:37,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-1: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:37,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-2: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:37,830 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:37,830 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:37,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-4: #race := #race[~#top~0.base,3 + ~#top~0.offset := 0]; [2025-02-08 05:11:37,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-5: #race := #race[~#top~0.base,2 + ~#top~0.offset := 0]; [2025-02-08 05:11:37,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-6: #race := #race[~#top~0.base,1 + ~#top~0.offset := 0]; [2025-02-08 05:11:37,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-7: #race := #race[~#top~0.base,~#top~0.offset := 0]; [2025-02-08 05:11:37,830 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:37,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752-1: push_#res#1 := 1; [2025-02-08 05:11:37,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: isEmpty_#res#1 := 1; [2025-02-08 05:11:37,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L738-1: isEmpty_#res#1 := 0; [2025-02-08 05:11:37,831 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:37,831 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:37,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-1: havoc __VERIFIER_atomic_CAS_#t~mem7#1; [2025-02-08 05:11:37,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L705-2: havoc __VERIFIER_atomic_CAS_#t~mem7#1; [2025-02-08 05:11:37,831 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:37,831 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:37,831 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:37,831 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:37,831 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:37,831 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:37,831 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:37,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:37,832 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:37,832 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:37,832 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-2: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:37,832 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:37,832 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:37,832 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:37,833 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:37,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-7: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:37,833 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:37,833 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:37,833 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:37,833 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:37,833 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:37,833 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:37,833 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:37,833 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L757: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 05:11:37,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-14: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:37,834 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:37,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L741: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:37,834 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:37,834 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:37,834 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:37,834 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:37,834 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:37,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: havoc push_#t~ret14#1; [2025-02-08 05:11:37,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: push_~newTop~0#1 := push_#t~ret14#1; [2025-02-08 05:11:37,834 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:37,835 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:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: push_#t~ret14#1 := index_malloc_#res#1; [2025-02-08 05:11:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:11:37,835 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:37,835 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:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-3: havoc __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-4: havoc __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-5: assume !__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-5: assume !!__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-6: havoc __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-7: havoc __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:37,835 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:37,835 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:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-10: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-11: __VERIFIER_atomic_assert_#t~ret19#1 := isEmpty_#res#1; [2025-02-08 05:11:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-12: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:37,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-13: assume __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-13: assume !__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L759-14: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 05:11:37,836 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:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: assume 0 == push_~newTop~0#1; [2025-02-08 05:11:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: assume !(0 == push_~newTop~0#1); [2025-02-08 05:11:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 05:11:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 05:11:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 05:11:37,836 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:37,836 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:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: push_#res#1 := 0; [2025-02-08 05:11:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: havoc __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:37,836 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:37,836 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:37,836 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:37,836 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:37,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-6: havoc __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:37,837 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:37,903 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:11:37,903 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:11:38,085 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:11:38,085 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:11:38,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:38 BoogieIcfgContainer [2025-02-08 05:11:38,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:11:38,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:11:38,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:11:38,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:11:38,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:11:36" (1/3) ... [2025-02-08 05:11:38,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92a4df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:38, skipping insertion in model container [2025-02-08 05:11:38,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:37" (2/3) ... [2025-02-08 05:11:38,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92a4df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:38, skipping insertion in model container [2025-02-08 05:11:38,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:38" (3/3) ... [2025-02-08 05:11:38,094 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas-race.i [2025-02-08 05:11:38,104 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:11:38,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas-race.i that has 2 procedures, 180 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-02-08 05:11:38,106 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:11:38,169 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:38,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 182 transitions, 368 flow [2025-02-08 05:11:38,268 INFO L124 PetriNetUnfolderBase]: 2/189 cut-off events. [2025-02-08 05:11:38,271 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:38,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 189 events. 2/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 171 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2025-02-08 05:11:38,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 182 transitions, 368 flow [2025-02-08 05:11:38,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 182 transitions, 368 flow [2025-02-08 05:11:38,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:38,297 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;@2e9aa17d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:38,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:11:38,321 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:38,321 INFO L124 PetriNetUnfolderBase]: 0/96 cut-off events. [2025-02-08 05:11:38,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:38,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:38,322 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] [2025-02-08 05:11:38,322 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:38,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:38,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1631184829, now seen corresponding path program 1 times [2025-02-08 05:11:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104479890] [2025-02-08 05:11:38,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:38,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:11:38,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:11:38,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:38,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:38,994 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:38,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:38,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104479890] [2025-02-08 05:11:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104479890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:38,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58266687] [2025-02-08 05:11:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:39,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:39,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:39,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:39,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:39,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 182 [2025-02-08 05:11:39,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 182 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 165.0) internal successors, (330), 2 states have internal predecessors, (330), 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:39,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:39,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 182 [2025-02-08 05:11:39,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:39,080 INFO L124 PetriNetUnfolderBase]: 2/169 cut-off events. [2025-02-08 05:11:39,081 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:39,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 2/169 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. 7/166 useless extension candidates. Maximal degree in co-relation 84. Up to 7 conditions per place. [2025-02-08 05:11:39,082 INFO L140 encePairwiseOnDemand]: 170/182 looper letters, 6 selfloop transitions, 0 changer transitions 0/166 dead transitions. [2025-02-08 05:11:39,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 348 flow [2025-02-08 05:11:39,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 346 transitions. [2025-02-08 05:11:39,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9505494505494505 [2025-02-08 05:11:39,097 INFO L175 Difference]: Start difference. First operand has 183 places, 182 transitions, 368 flow. Second operand 2 states and 346 transitions. [2025-02-08 05:11:39,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 348 flow [2025-02-08 05:11:39,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:39,104 INFO L231 Difference]: Finished difference. Result has 168 places, 166 transitions, 336 flow [2025-02-08 05:11:39,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=336, PETRI_PLACES=168, PETRI_TRANSITIONS=166} [2025-02-08 05:11:39,108 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, -15 predicate places. [2025-02-08 05:11:39,108 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 336 flow [2025-02-08 05:11:39,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 165.0) internal successors, (330), 2 states have internal predecessors, (330), 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:39,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:39,110 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] [2025-02-08 05:11:39,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:11:39,111 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:39,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash 94470183, now seen corresponding path program 1 times [2025-02-08 05:11:39,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611707699] [2025-02-08 05:11:39,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:39,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:11:39,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:11:39,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:39,205 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:39,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611707699] [2025-02-08 05:11:39,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611707699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:39,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:39,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:39,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684082787] [2025-02-08 05:11:39,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:39,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:39,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:39,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:39,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 182 [2025-02-08 05:11:39,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:39,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:39,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 182 [2025-02-08 05:11:39,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:39,268 INFO L124 PetriNetUnfolderBase]: 2/218 cut-off events. [2025-02-08 05:11:39,268 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:39,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 218 events. 2/218 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/203 useless extension candidates. Maximal degree in co-relation 233. Up to 8 conditions per place. [2025-02-08 05:11:39,270 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 11 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-02-08 05:11:39,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 169 transitions, 368 flow [2025-02-08 05:11:39,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-02-08 05:11:39,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-02-08 05:11:39,274 INFO L175 Difference]: Start difference. First operand has 168 places, 166 transitions, 336 flow. Second operand 3 states and 494 transitions. [2025-02-08 05:11:39,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 169 transitions, 368 flow [2025-02-08 05:11:39,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 169 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:39,277 INFO L231 Difference]: Finished difference. Result has 169 places, 165 transitions, 338 flow [2025-02-08 05:11:39,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2025-02-08 05:11:39,279 INFO L279 CegarLoopForPetriNet]: 183 programPoint places, -14 predicate places. [2025-02-08 05:11:39,279 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 338 flow [2025-02-08 05:11:39,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:39,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:39,282 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] [2025-02-08 05:11:39,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:11:39,282 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:39,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1723560077, now seen corresponding path program 1 times [2025-02-08 05:11:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:39,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414424572] [2025-02-08 05:11:39,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:39,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:11:39,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:11:39,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:39,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:39,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:39,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:11:39,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:11:39,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:39,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:39,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:39,363 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:39,364 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2025-02-08 05:11:39,365 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:11:39,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:11:39,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:11:39,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:11:39,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:11:39,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:11:39,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:11:39,366 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:11:39,367 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-02-08 05:11:39,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-02-08 05:11:39,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-02-08 05:11:39,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:11:39,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-02-08 05:11:39,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-02-08 05:11:39,368 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:11:39,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:11:39,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:11:39,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:11:39,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:11:39,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:11:39,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:11:39,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:11:39,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:11:39,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:11:39,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:11:39,371 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:39,373 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:39,374 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:11:39,445 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:39,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 269 transitions, 548 flow [2025-02-08 05:11:39,494 INFO L124 PetriNetUnfolderBase]: 4/285 cut-off events. [2025-02-08 05:11:39,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:11:39,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 285 events. 4/285 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 628 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2025-02-08 05:11:39,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 269 transitions, 548 flow [2025-02-08 05:11:39,500 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 270 places, 269 transitions, 548 flow [2025-02-08 05:11:39,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:39,502 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;@2e9aa17d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:39,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 05:11:39,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:39,513 INFO L124 PetriNetUnfolderBase]: 0/96 cut-off events. [2025-02-08 05:11:39,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:39,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:39,513 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] [2025-02-08 05:11:39,513 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:39,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1186213434, now seen corresponding path program 1 times [2025-02-08 05:11:39,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:39,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335980811] [2025-02-08 05:11:39,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:39,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:39,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:11:39,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:11:39,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:39,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:39,771 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:39,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335980811] [2025-02-08 05:11:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335980811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:39,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:39,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:39,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105349187] [2025-02-08 05:11:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:39,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:39,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:39,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:39,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:39,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 269 [2025-02-08 05:11:39,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 269 transitions, 548 flow. Second operand has 2 states, 2 states have (on average 235.0) internal successors, (470), 2 states have internal predecessors, (470), 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:39,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:39,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 269 [2025-02-08 05:11:39,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:39,932 INFO L124 PetriNetUnfolderBase]: 38/680 cut-off events. [2025-02-08 05:11:39,933 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:11:39,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 680 events. 38/680 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3141 event pairs, 23 based on Foata normal form. 46/644 useless extension candidates. Maximal degree in co-relation 561. Up to 66 conditions per place. [2025-02-08 05:11:39,940 INFO L140 encePairwiseOnDemand]: 246/269 looper letters, 12 selfloop transitions, 0 changer transitions 0/241 dead transitions. [2025-02-08 05:11:39,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 241 transitions, 516 flow [2025-02-08 05:11:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 503 transitions. [2025-02-08 05:11:39,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9349442379182156 [2025-02-08 05:11:39,942 INFO L175 Difference]: Start difference. First operand has 270 places, 269 transitions, 548 flow. Second operand 2 states and 503 transitions. [2025-02-08 05:11:39,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 241 transitions, 516 flow [2025-02-08 05:11:39,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 241 transitions, 516 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:39,948 INFO L231 Difference]: Finished difference. Result has 243 places, 241 transitions, 492 flow [2025-02-08 05:11:39,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=492, PETRI_PLACES=243, PETRI_TRANSITIONS=241} [2025-02-08 05:11:39,949 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -27 predicate places. [2025-02-08 05:11:39,949 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 241 transitions, 492 flow [2025-02-08 05:11:39,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 235.0) internal successors, (470), 2 states have internal predecessors, (470), 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:39,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:39,951 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] [2025-02-08 05:11:39,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:11:39,951 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:39,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:39,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1784737462, now seen corresponding path program 1 times [2025-02-08 05:11:39,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:39,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434892295] [2025-02-08 05:11:39,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:39,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:39,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:11:39,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:11:39,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:39,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:40,018 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:40,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:40,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434892295] [2025-02-08 05:11:40,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434892295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:40,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:40,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:40,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34357372] [2025-02-08 05:11:40,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:40,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:40,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:40,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:40,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:40,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 269 [2025-02-08 05:11:40,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 241 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 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:40,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:40,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 269 [2025-02-08 05:11:40,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:40,304 INFO L124 PetriNetUnfolderBase]: 151/1829 cut-off events. [2025-02-08 05:11:40,304 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 05:11:40,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 1829 events. 151/1829 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13816 event pairs, 50 based on Foata normal form. 0/1596 useless extension candidates. Maximal degree in co-relation 2154. Up to 147 conditions per place. [2025-02-08 05:11:40,319 INFO L140 encePairwiseOnDemand]: 261/269 looper letters, 31 selfloop transitions, 6 changer transitions 0/258 dead transitions. [2025-02-08 05:11:40,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 258 transitions, 605 flow [2025-02-08 05:11:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-02-08 05:11:40,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8884758364312267 [2025-02-08 05:11:40,322 INFO L175 Difference]: Start difference. First operand has 243 places, 241 transitions, 492 flow. Second operand 3 states and 717 transitions. [2025-02-08 05:11:40,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 258 transitions, 605 flow [2025-02-08 05:11:40,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 258 transitions, 605 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:40,326 INFO L231 Difference]: Finished difference. Result has 247 places, 247 transitions, 544 flow [2025-02-08 05:11:40,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=247, PETRI_TRANSITIONS=247} [2025-02-08 05:11:40,327 INFO L279 CegarLoopForPetriNet]: 270 programPoint places, -23 predicate places. [2025-02-08 05:11:40,327 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 247 transitions, 544 flow [2025-02-08 05:11:40,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 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:40,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:40,327 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] [2025-02-08 05:11:40,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:11:40,328 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:40,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1918942857, now seen corresponding path program 1 times [2025-02-08 05:11:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:40,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667790698] [2025-02-08 05:11:40,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:40,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:11:40,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:11:40,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:40,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:40,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:40,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:11:40,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:11:40,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:40,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:40,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:40,376 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:40,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 52 remaining) [2025-02-08 05:11:40,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2025-02-08 05:11:40,376 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2025-02-08 05:11:40,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2025-02-08 05:11:40,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2025-02-08 05:11:40,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2025-02-08 05:11:40,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2025-02-08 05:11:40,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2025-02-08 05:11:40,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2025-02-08 05:11:40,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2025-02-08 05:11:40,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:11:40,380 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:40,381 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:40,381 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:11:40,463 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:40,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 356 transitions, 730 flow [2025-02-08 05:11:40,509 INFO L124 PetriNetUnfolderBase]: 6/381 cut-off events. [2025-02-08 05:11:40,509 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:11:40,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 381 events. 6/381 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1177 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 289. Up to 4 conditions per place. [2025-02-08 05:11:40,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 357 places, 356 transitions, 730 flow [2025-02-08 05:11:40,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 356 transitions, 730 flow [2025-02-08 05:11:40,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:40,516 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;@2e9aa17d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:40,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:11:40,522 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:40,522 INFO L124 PetriNetUnfolderBase]: 0/95 cut-off events. [2025-02-08 05:11:40,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:40,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:40,522 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] [2025-02-08 05:11:40,522 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:40,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:40,523 INFO L85 PathProgramCache]: Analyzing trace with hash 935416704, now seen corresponding path program 1 times [2025-02-08 05:11:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:40,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206194921] [2025-02-08 05:11:40,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:40,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:11:40,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:11:40,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:40,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:40,726 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:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206194921] [2025-02-08 05:11:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206194921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:40,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:40,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493782826] [2025-02-08 05:11:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:40,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:40,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:40,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:40,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 356 [2025-02-08 05:11:40,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 356 transitions, 730 flow. Second operand has 2 states, 2 states have (on average 305.0) internal successors, (610), 2 states have internal predecessors, (610), 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:40,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:40,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 356 [2025-02-08 05:11:40,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:41,302 INFO L124 PetriNetUnfolderBase]: 392/3775 cut-off events. [2025-02-08 05:11:41,302 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 05:11:41,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 3775 events. 392/3775 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 34670 event pairs, 294 based on Foata normal form. 306/3569 useless extension candidates. Maximal degree in co-relation 3534. Up to 561 conditions per place. [2025-02-08 05:11:41,332 INFO L140 encePairwiseOnDemand]: 322/356 looper letters, 18 selfloop transitions, 0 changer transitions 0/316 dead transitions. [2025-02-08 05:11:41,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 316 transitions, 686 flow [2025-02-08 05:11:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 660 transitions. [2025-02-08 05:11:41,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9269662921348315 [2025-02-08 05:11:41,334 INFO L175 Difference]: Start difference. First operand has 357 places, 356 transitions, 730 flow. Second operand 2 states and 660 transitions. [2025-02-08 05:11:41,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 316 transitions, 686 flow [2025-02-08 05:11:41,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 316 transitions, 684 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:41,339 INFO L231 Difference]: Finished difference. Result has 318 places, 316 transitions, 648 flow [2025-02-08 05:11:41,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=648, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2025-02-08 05:11:41,339 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, -39 predicate places. [2025-02-08 05:11:41,340 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 648 flow [2025-02-08 05:11:41,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 305.0) internal successors, (610), 2 states have internal predecessors, (610), 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:41,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:41,340 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] [2025-02-08 05:11:41,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:11:41,340 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:41,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1287338244, now seen corresponding path program 1 times [2025-02-08 05:11:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022051579] [2025-02-08 05:11:41,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:41,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:11:41,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:11:41,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:41,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:41,384 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:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022051579] [2025-02-08 05:11:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022051579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:41,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204903422] [2025-02-08 05:11:41,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:41,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:41,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:41,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:41,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 356 [2025-02-08 05:11:41,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:41,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:41,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 356 [2025-02-08 05:11:41,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:43,801 INFO L124 PetriNetUnfolderBase]: 3227/21055 cut-off events. [2025-02-08 05:11:43,802 INFO L125 PetriNetUnfolderBase]: For 418/418 co-relation queries the response was YES. [2025-02-08 05:11:43,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26314 conditions, 21055 events. 3227/21055 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 279089 event pairs, 1134 based on Foata normal form. 0/18142 useless extension candidates. Maximal degree in co-relation 26308. Up to 2458 conditions per place. [2025-02-08 05:11:43,956 INFO L140 encePairwiseOnDemand]: 344/356 looper letters, 47 selfloop transitions, 9 changer transitions 0/342 dead transitions. [2025-02-08 05:11:43,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 342 transitions, 822 flow [2025-02-08 05:11:43,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2025-02-08 05:11:43,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8754681647940075 [2025-02-08 05:11:43,959 INFO L175 Difference]: Start difference. First operand has 318 places, 316 transitions, 648 flow. Second operand 3 states and 935 transitions. [2025-02-08 05:11:43,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 342 transitions, 822 flow [2025-02-08 05:11:43,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 342 transitions, 822 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:43,963 INFO L231 Difference]: Finished difference. Result has 322 places, 325 transitions, 726 flow [2025-02-08 05:11:43,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=322, PETRI_TRANSITIONS=325} [2025-02-08 05:11:43,965 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, -35 predicate places. [2025-02-08 05:11:43,966 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 325 transitions, 726 flow [2025-02-08 05:11:43,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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:43,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:43,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:43,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:11:43,966 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:43,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash 69565842, now seen corresponding path program 1 times [2025-02-08 05:11:43,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:43,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969403983] [2025-02-08 05:11:43,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:43,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:43,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:11:43,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:11:43,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:43,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:44,401 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:44,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:44,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969403983] [2025-02-08 05:11:44,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969403983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:44,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:44,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:11:44,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198289349] [2025-02-08 05:11:44,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:44,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:11:44,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:44,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:11:44,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:11:44,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 356 [2025-02-08 05:11:44,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 325 transitions, 726 flow. Second operand has 6 states, 6 states have (on average 284.6666666666667) internal successors, (1708), 6 states have internal predecessors, (1708), 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:44,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:44,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 356 [2025-02-08 05:11:44,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:46,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][263], [143#L781-1true, 354#true, 360#true, 367#true, 238#L789-2true, 356#true, 318#L732-1true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:46,475 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2025-02-08 05:11:46,475 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-02-08 05:11:46,475 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-02-08 05:11:46,475 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-02-08 05:11:46,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [143#L781-1true, 354#true, 360#true, 238#L789-2true, 356#true, 367#true, 267#L781-1true, Black: 362#true, 306#L777-1true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:46,593 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-02-08 05:11:46,593 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-08 05:11:46,593 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-02-08 05:11:46,593 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-02-08 05:11:46,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [136#L777true, 143#L781-1true, 354#true, 360#true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:46,682 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-02-08 05:11:46,682 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-08 05:11:46,682 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2025-02-08 05:11:46,682 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:11:47,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [190#L732-3true, 257#L778-2true, 354#true, 360#true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:47,181 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2025-02-08 05:11:47,182 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:11:47,182 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:11:47,182 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-08 05:11:47,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [4#L732-2true, 257#L778-2true, 354#true, 360#true, 238#L789-2true, 356#true, 367#true, Black: 362#true, 267#L781-1true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:47,258 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:11:47,258 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:11:47,258 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:11:47,259 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-02-08 05:11:47,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [257#L778-2true, 354#true, 360#true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 272#L732true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:47,333 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2025-02-08 05:11:47,334 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-02-08 05:11:47,334 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-02-08 05:11:47,334 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2025-02-08 05:11:47,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [57#L732-1true, 257#L778-2true, 354#true, 360#true, 367#true, 238#L789-2true, 356#true, Black: 362#true, 267#L781-1true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:47,408 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-02-08 05:11:47,408 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-02-08 05:11:47,408 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-02-08 05:11:47,408 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-02-08 05:11:47,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [354#true, 360#true, 367#true, 238#L789-2true, 356#true, 108#L721-2true, 267#L781-1true, Black: 362#true, 311#L732-4true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:47,865 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2025-02-08 05:11:47,865 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-02-08 05:11:47,865 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-02-08 05:11:47,865 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2025-02-08 05:11:47,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [310#L732-3true, 354#true, 360#true, 238#L789-2true, 356#true, 367#true, 108#L721-2true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:47,942 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-02-08 05:11:47,942 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-08 05:11:47,942 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-02-08 05:11:47,942 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-08 05:11:48,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [33#L732-2true, 354#true, 360#true, 108#L721-2true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,018 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-02-08 05:11:48,018 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:11:48,018 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-02-08 05:11:48,018 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:11:48,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [170#L732true, 354#true, 360#true, 108#L721-2true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,095 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2025-02-08 05:11:48,095 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-08 05:11:48,095 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:11:48,095 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:11:48,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][263], [354#true, 360#true, 367#true, 108#L721-2true, 238#L789-2true, 356#true, 318#L732-1true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,174 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-02-08 05:11:48,174 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:48,174 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:48,174 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:48,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [354#true, 360#true, 367#true, 238#L789-2true, 356#true, 318#L732-1true, 108#L721-2true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,175 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-02-08 05:11:48,175 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:48,175 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:48,175 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:48,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [49#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 354#true, 360#true, 108#L721-2true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,175 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-02-08 05:11:48,175 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:48,175 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:48,175 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:48,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [354#true, 213#L723true, 360#true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 311#L732-4true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,177 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2025-02-08 05:11:48,177 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:48,177 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:48,177 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:48,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [354#true, 360#true, 367#true, 238#L789-2true, 356#true, 108#L721-2true, 267#L781-1true, Black: 362#true, 306#L777-1true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:48,242 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-02-08 05:11:48,242 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-02-08 05:11:48,242 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-02-08 05:11:48,242 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-02-08 05:11:48,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [310#L732-3true, 354#true, 213#L723true, 360#true, 238#L789-2true, 356#true, 367#true, Black: 362#true, 267#L781-1true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,244 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2025-02-08 05:11:48,244 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-02-08 05:11:48,244 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-02-08 05:11:48,244 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-02-08 05:11:48,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [136#L777true, 354#true, 360#true, 367#true, 108#L721-2true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:48,309 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-02-08 05:11:48,309 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-02-08 05:11:48,309 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-02-08 05:11:48,309 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-02-08 05:11:48,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [33#L732-2true, 213#L723true, 354#true, 360#true, 238#L789-2true, 356#true, 367#true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,310 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2025-02-08 05:11:48,310 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-02-08 05:11:48,310 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2025-02-08 05:11:48,310 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-02-08 05:11:48,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [170#L732true, 213#L723true, 354#true, 360#true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,381 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2025-02-08 05:11:48,381 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-08 05:11:48,381 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2025-02-08 05:11:48,381 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-08 05:11:48,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][263], [213#L723true, 354#true, 360#true, 238#L789-2true, 356#true, 367#true, 318#L732-1true, Black: 362#true, 267#L781-1true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,451 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [354#true, 213#L723true, 360#true, 238#L789-2true, 356#true, 318#L732-1true, 367#true, Black: 362#true, 267#L781-1true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,452 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [49#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 213#L723true, 354#true, 360#true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:48,452 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-02-08 05:11:48,452 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:48,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [213#L723true, 354#true, 360#true, 238#L789-2true, 356#true, 367#true, 267#L781-1true, Black: 362#true, 306#L777-1true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:48,646 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2025-02-08 05:11:48,646 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-02-08 05:11:48,646 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-02-08 05:11:48,646 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2025-02-08 05:11:48,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [136#L777true, 213#L723true, 354#true, 360#true, 367#true, 238#L789-2true, 356#true, 267#L781-1true, Black: 362#true, 358#true, 364#(= |#race~state~0| 0)]) [2025-02-08 05:11:48,719 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-02-08 05:11:48,719 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-02-08 05:11:48,719 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-02-08 05:11:48,719 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-02-08 05:11:49,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1448] L780-4-->L781-1: Formula: (let ((.cse1 (select |v_#race_615| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse3 (select |v_#memory_int_189| |v_~#m2~0.base_23|)) (.cse0 (select .cse1 .cse5)) (.cse4 (+ |v_~#m2~0.offset_23| 1))) (and (= .cse0 (select .cse1 .cse2)) (not (= 0 (ite (= (select .cse3 |v_~#m2~0.offset_23|) 1) 1 0))) (= (store |v_#race_617| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_617| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse0) .cse4 .cse0) .cse2 .cse0) .cse5 .cse0)) |v_#race_615|) (= (store |v_#memory_int_189| |v_~#m2~0.base_23| (store .cse3 |v_~#m2~0.offset_23| 0)) |v_#memory_int_188|) (= (select .cse1 |v_~#m2~0.offset_23|) .cse0) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_617|, #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_615|, 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][203], [326#L729-1true, 49#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 354#true, 360#true, 238#L789-2true, 356#true, 367#true, Black: 362#true, 267#L781-1true, 364#(= |#race~state~0| 0), 358#true]) [2025-02-08 05:11:49,170 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-02-08 05:11:49,170 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-08 05:11:49,170 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:49,170 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:49,991 INFO L124 PetriNetUnfolderBase]: 13850/58494 cut-off events. [2025-02-08 05:11:49,991 INFO L125 PetriNetUnfolderBase]: For 1961/1966 co-relation queries the response was YES. [2025-02-08 05:11:50,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82714 conditions, 58494 events. 13850/58494 cut-off events. For 1961/1966 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 854443 event pairs, 5973 based on Foata normal form. 0/51028 useless extension candidates. Maximal degree in co-relation 82706. Up to 16407 conditions per place. [2025-02-08 05:11:50,485 INFO L140 encePairwiseOnDemand]: 329/356 looper letters, 72 selfloop transitions, 78 changer transitions 0/436 dead transitions. [2025-02-08 05:11:50,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 436 transitions, 1288 flow [2025-02-08 05:11:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:11:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:11:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1849 transitions. [2025-02-08 05:11:50,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656367041198502 [2025-02-08 05:11:50,489 INFO L175 Difference]: Start difference. First operand has 322 places, 325 transitions, 726 flow. Second operand 6 states and 1849 transitions. [2025-02-08 05:11:50,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 436 transitions, 1288 flow [2025-02-08 05:11:50,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 436 transitions, 1270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:50,509 INFO L231 Difference]: Finished difference. Result has 329 places, 406 transitions, 1192 flow [2025-02-08 05:11:50,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1192, PETRI_PLACES=329, PETRI_TRANSITIONS=406} [2025-02-08 05:11:50,511 INFO L279 CegarLoopForPetriNet]: 357 programPoint places, -28 predicate places. [2025-02-08 05:11:50,511 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 406 transitions, 1192 flow [2025-02-08 05:11:50,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.6666666666667) internal successors, (1708), 6 states have internal predecessors, (1708), 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:50,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:50,513 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] [2025-02-08 05:11:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:11:50,513 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:11:50,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash 969964009, now seen corresponding path program 1 times [2025-02-08 05:11:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912221317] [2025-02-08 05:11:50,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:50,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:11:50,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:11:50,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:50,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:50,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:50,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:11:50,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:11:50,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:50,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:50,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:50,571 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:50,571 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 69 remaining) [2025-02-08 05:11:50,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:11:50,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:11:50,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:11:50,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:11:50,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:11:50,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:11:50,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:11:50,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:11:50,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:11:50,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:11:50,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:11:50,572 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:11:50,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 69 remaining) [2025-02-08 05:11:50,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:11:50,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:11:50,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:11:50,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:11:50,576 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:11:50,577 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:50,577 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:11:50,667 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:50,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 443 transitions, 914 flow [2025-02-08 05:11:50,749 INFO L124 PetriNetUnfolderBase]: 8/477 cut-off events. [2025-02-08 05:11:50,749 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:11:50,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 477 events. 8/477 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1794 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 389. Up to 5 conditions per place. [2025-02-08 05:11:50,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 443 transitions, 914 flow [2025-02-08 05:11:50,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 444 places, 443 transitions, 914 flow [2025-02-08 05:11:50,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:50,761 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;@2e9aa17d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:50,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 05:11:50,766 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:50,766 INFO L124 PetriNetUnfolderBase]: 0/96 cut-off events. [2025-02-08 05:11:50,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:50,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:50,767 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] [2025-02-08 05:11:50,767 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:11:50,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash 438743793, now seen corresponding path program 1 times [2025-02-08 05:11:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:50,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193218143] [2025-02-08 05:11:50,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:50,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 05:11:50,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 05:11:50,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:50,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:50,971 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:50,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:50,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193218143] [2025-02-08 05:11:50,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193218143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:50,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:50,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468332510] [2025-02-08 05:11:50,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:50,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:50,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:50,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:50,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 443 [2025-02-08 05:11:50,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 443 transitions, 914 flow. Second operand has 2 states, 2 states have (on average 375.0) internal successors, (750), 2 states have internal predecessors, (750), 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:50,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:50,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 443 [2025-02-08 05:11:50,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:53,878 INFO L124 PetriNetUnfolderBase]: 3368/22876 cut-off events. [2025-02-08 05:11:53,878 INFO L125 PetriNetUnfolderBase]: For 1926/1926 co-relation queries the response was YES. [2025-02-08 05:11:53,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28272 conditions, 22876 events. 3368/22876 cut-off events. For 1926/1926 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 302175 event pairs, 2768 based on Foata normal form. 2036/21842 useless extension candidates. Maximal degree in co-relation 22590. Up to 4393 conditions per place. [2025-02-08 05:11:54,094 INFO L140 encePairwiseOnDemand]: 398/443 looper letters, 24 selfloop transitions, 0 changer transitions 0/391 dead transitions. [2025-02-08 05:11:54,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 391 transitions, 858 flow [2025-02-08 05:11:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 817 transitions. [2025-02-08 05:11:54,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9221218961625283 [2025-02-08 05:11:54,096 INFO L175 Difference]: Start difference. First operand has 444 places, 443 transitions, 914 flow. Second operand 2 states and 817 transitions. [2025-02-08 05:11:54,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 391 transitions, 858 flow [2025-02-08 05:11:54,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 391 transitions, 852 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:54,101 INFO L231 Difference]: Finished difference. Result has 393 places, 391 transitions, 804 flow [2025-02-08 05:11:54,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=804, PETRI_PLACES=393, PETRI_TRANSITIONS=391} [2025-02-08 05:11:54,102 INFO L279 CegarLoopForPetriNet]: 444 programPoint places, -51 predicate places. [2025-02-08 05:11:54,102 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 391 transitions, 804 flow [2025-02-08 05:11:54,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 375.0) internal successors, (750), 2 states have internal predecessors, (750), 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,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:54,103 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] [2025-02-08 05:11:54,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:11:54,103 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:11:54,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:54,103 INFO L85 PathProgramCache]: Analyzing trace with hash 726057557, now seen corresponding path program 1 times [2025-02-08 05:11:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:54,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971160798] [2025-02-08 05:11:54,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:54,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:11:54,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:11:54,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:54,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:54,146 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 [1971160798] [2025-02-08 05:11:54,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971160798] 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,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896014376] [2025-02-08 05:11:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:54,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:54,147 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 3 interpolants. [2025-02-08 05:11:54,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:54,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 443 [2025-02-08 05:11:54,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 391 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 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,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:54,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 443 [2025-02-08 05:11:54,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand