./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.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 f6a420ba5144c69cefe02db203552770c4018653c510d9792e57ffedc3dfc64e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:11:41,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:11:41,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:11:41,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:11:41,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:11:41,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:11:41,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:11:41,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:11:41,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:11:41,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:11:41,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:11:41,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:11:41,369 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:11:41,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:11:41,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:11:41,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:11:41,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:11:41,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:11:41,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:11:41,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:41,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:11:41,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:11:41,371 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:11:41,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:11:41,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:11:41,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:11:41,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:11:41,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:11:41,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:11:41,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:11:41,372 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 -> f6a420ba5144c69cefe02db203552770c4018653c510d9792e57ffedc3dfc64e [2025-02-08 05:11:41,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:11:41,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:11:41,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:11:41,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:11:41,585 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:11:41,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i [2025-02-08 05:11:42,719 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397eb98c9/e4dd828612644aa583f587634aa5600c/FLAGbeb8d639d [2025-02-08 05:11:43,125 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:11:43,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i [2025-02-08 05:11:43,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397eb98c9/e4dd828612644aa583f587634aa5600c/FLAGbeb8d639d [2025-02-08 05:11:43,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/397eb98c9/e4dd828612644aa583f587634aa5600c [2025-02-08 05:11:43,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:11:43,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:11:43,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:43,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:11:43,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:11:43,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12021fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43, skipping insertion in model container [2025-02-08 05:11:43,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:11:43,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:43,655 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:11:43,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:43,818 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:11:43,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43 WrapperNode [2025-02-08 05:11:43,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:43,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:43,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:11:43,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:11:43,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,896 INFO L138 Inliner]: procedures = 179, calls = 47, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 954 [2025-02-08 05:11:43,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:43,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:11:43,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:11:43,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:11:43,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:11:43,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:11:43,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:11:43,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:11:43,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (1/1) ... [2025-02-08 05:11:43,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:43,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:11:43,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:11:43,986 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:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:11:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:11:44,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:11:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:11:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:11:44,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:11:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:11:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:11:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:11:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:11:44,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:11:44,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:11:44,002 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:44,112 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:11:44,113 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: assume ((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: assume !(((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet10#1); [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: push_#res#1 := 0; [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-1: havoc __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-2: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet10#1]; [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-3: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet10#1]; [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-4: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet10#1]; [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-5: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet10#1]; [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-6: havoc __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:44,536 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-7: SUMMARY for call write~int(0, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-3: havoc __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-4: havoc __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-5: assume !__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-5: assume !!__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-6: havoc __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-7: havoc __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:44,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-8: __VERIFIER_atomic_assert_#t~short20#1 := 0 == __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-9: assume { :end_inline_isEmpty } true;assume -2147483648 <= __VERIFIER_atomic_assert_#t~ret19#1 && __VERIFIER_atomic_assert_#t~ret19#1 <= 2147483647; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-10: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-11: __VERIFIER_atomic_assert_#t~ret19#1 := isEmpty_#res#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-12: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-13: assume __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-13: assume !__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-14: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-15: __VERIFIER_atomic_assert_#t~short20#1 := 0 == __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume #race~memory~0[push_~newTop~0#1] == push_#t~nondet15#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume !(#race~memory~0[push_~newTop~0#1] == push_#t~nondet15#1); [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: havoc push_#t~nondet15#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: #race~memory~0 := #race~memory~0[push_~newTop~0#1 := push_#t~nondet15#1]; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-3: havoc push_#t~nondet15#1; [2025-02-08 05:11:44,538 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-4: ~memory~0 := ~memory~0[push_~newTop~0#1 := push_~d#1]; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume true; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume !true; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701: __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-1: __VERIFIER_atomic_CAS_~u#1 := __VERIFIER_atomic_CAS_#in~u#1; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-2: __VERIFIER_atomic_CAS_~e#1 := __VERIFIER_atomic_CAS_#in~e#1; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L701-3: __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc push_#t~mem16#1; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: assume ((0 == #race[~#top~0.base,~#top~0.offset] && 0 == #race[~#top~0.base,1 + ~#top~0.offset]) && 0 == #race[~#top~0.base,2 + ~#top~0.offset]) && 0 == #race[~#top~0.base,3 + ~#top~0.offset]; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: assume !(((0 == #race[~#top~0.base,~#top~0.offset] && 0 == #race[~#top~0.base,1 + ~#top~0.offset]) && 0 == #race[~#top~0.base,2 + ~#top~0.offset]) && 0 == #race[~#top~0.base,3 + ~#top~0.offset]); [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: push_~oldTop~0#1 := push_#t~mem16#1; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-3: #race := #race[~#top~0.base,3 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-4: #race := #race[~#top~0.base,2 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-5: #race := #race[~#top~0.base,1 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-6: #race := #race[~#top~0.base,~#top~0.offset := 0]; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-7: SUMMARY for call push_#t~mem16#1 := read~int(~#top~0.base, ~#top~0.offset, 4); srcloc: null [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752: [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc push_loop_#t~ret22#1; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-1: push_loop_~r~0#1 := push_loop_#t~ret22#1; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-2: assume { :end_inline_push } true;assume -2147483648 <= push_loop_#t~ret22#1 && push_loop_#t~ret22#1 <= 2147483647; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-3: havoc push_#in~d#1; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-4: havoc push_#t~ret14#1, push_#t~nondet15#1, push_#t~mem16#1, push_#t~nondet17#1, push_#t~mem18#1, push_~d#1, push_~oldTop~0#1, push_~newTop~0#1, push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-5: push_loop_#t~ret22#1 := push_#res#1; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753: assume #race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet17#1; [2025-02-08 05:11:44,539 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753: assume !(#race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet17#1); [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-1: havoc push_#t~nondet17#1; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-2: #race~memory~0 := #race~memory~0[1 + push_~newTop~0#1 := push_#t~nondet17#1]; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-3: havoc push_#t~nondet17#1; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-4: ~memory~0 := ~memory~0[1 + push_~newTop~0#1 := push_~oldTop~0#1]; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770-1: havoc __VERIFIER_atomic_assert_#in~r#1;assume { :end_inline___VERIFIER_atomic_assert } true; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: assume 0 == isEmpty_#t~mem13#1; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: assume !(0 == isEmpty_#t~mem13#1); [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770-2: havoc __VERIFIER_atomic_assert_#t~ret19#1, __VERIFIER_atomic_assert_#t~short20#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-1: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-2: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770-3: havoc __VERIFIER_atomic_assert_#t~ret19#1, __VERIFIER_atomic_assert_#t~short20#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-3: assume ((0 == #race[~#top~0.base,~#top~0.offset] && 0 == #race[~#top~0.base,1 + ~#top~0.offset]) && 0 == #race[~#top~0.base,2 + ~#top~0.offset]) && 0 == #race[~#top~0.base,3 + ~#top~0.offset]; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-3: assume !(((0 == #race[~#top~0.base,~#top~0.offset] && 0 == #race[~#top~0.base,1 + ~#top~0.offset]) && 0 == #race[~#top~0.base,2 + ~#top~0.offset]) && 0 == #race[~#top~0.base,3 + ~#top~0.offset]); [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770-4: assume { :begin_inline___VERIFIER_atomic_assert } true;__VERIFIER_atomic_assert_#in~r#1 := push_loop_~r~0#1; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-4: #race := #race[~#top~0.base,3 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-5: #race := #race[~#top~0.base,2 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-6: #race := #race[~#top~0.base,1 + ~#top~0.offset := 0]; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-7: #race := #race[~#top~0.base,~#top~0.offset := 0]; [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-8: SUMMARY for call isEmpty_#t~mem13#1 := read~int(~#top~0.base, ~#top~0.offset, 4); srcloc: null [2025-02-08 05:11:44,540 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754: [2025-02-08 05:11:44,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-1: havoc __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset;assume { :end_inline___VERIFIER_atomic_CAS } true; [2025-02-08 05:11:44,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-2: havoc __VERIFIER_atomic_CAS_#t~mem7#1, __VERIFIER_atomic_CAS_#t~nondet8#1, __VERIFIER_atomic_CAS_#t~nondet9#1, __VERIFIER_atomic_CAS_#t~nondet10#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 05:11:44,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-3: havoc __VERIFIER_atomic_CAS_#t~mem7#1, __VERIFIER_atomic_CAS_#t~nondet8#1, __VERIFIER_atomic_CAS_#t~nondet9#1, __VERIFIER_atomic_CAS_#t~nondet10#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 05:11:44,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-4: assume { :begin_inline___VERIFIER_atomic_CAS } true;__VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset := ~#top~0.base, ~#top~0.offset, push_~oldTop~0#1, push_~newTop~0#1, push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L738-1: isEmpty_#res#1 := 1; [2025-02-08 05:11:44,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755: assume 1 == push_#t~mem18#1; [2025-02-08 05:11:44,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755: assume !(1 == push_#t~mem18#1); [2025-02-08 05:11:44,541 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-1: havoc push_#t~mem18#1; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-2: havoc push_#t~mem18#1; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-3: assume ((0 == #race[push_~#casret~0#1.base,push_~#casret~0#1.offset] && 0 == #race[push_~#casret~0#1.base,1 + push_~#casret~0#1.offset]) && 0 == #race[push_~#casret~0#1.base,2 + push_~#casret~0#1.offset]) && 0 == #race[push_~#casret~0#1.base,3 + push_~#casret~0#1.offset]; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-3: assume !(((0 == #race[push_~#casret~0#1.base,push_~#casret~0#1.offset] && 0 == #race[push_~#casret~0#1.base,1 + push_~#casret~0#1.offset]) && 0 == #race[push_~#casret~0#1.base,2 + push_~#casret~0#1.offset]) && 0 == #race[push_~#casret~0#1.base,3 + push_~#casret~0#1.offset]); [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-4: #race := #race[push_~#casret~0#1.base,3 + push_~#casret~0#1.offset := 0]; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-5: #race := #race[push_~#casret~0#1.base,2 + push_~#casret~0#1.offset := 0]; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-6: #race := #race[push_~#casret~0#1.base,1 + push_~#casret~0#1.offset := 0]; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-7: #race := #race[push_~#casret~0#1.base,push_~#casret~0#1.offset := 0]; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-8: SUMMARY for call push_#t~mem18#1 := read~int(push_~#casret~0#1.base, push_~#casret~0#1.offset, 4); srcloc: null [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L756-1: push_#res#1 := 1; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L740-1: isEmpty_#res#1 := 0; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: assume __VERIFIER_atomic_CAS_#t~mem7#1 == __VERIFIER_atomic_CAS_~e#1; [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: assume !(__VERIFIER_atomic_CAS_#t~mem7#1 == __VERIFIER_atomic_CAS_~e#1); [2025-02-08 05:11:44,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: havoc __VERIFIER_atomic_CAS_#t~mem7#1; [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-2: havoc __VERIFIER_atomic_CAS_#t~mem7#1; [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-3: assume ((0 == #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset]; [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-3: assume !(((0 == #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset]); [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-4: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-5: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-6: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-7: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-8: SUMMARY for call __VERIFIER_atomic_CAS_#t~mem7#1 := read~int(__VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: assume ((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: assume !(((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1); [2025-02-08 05:11:44,543 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-2: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-3: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-4: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-5: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-6: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-7: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-8: SUMMARY for call write~int(1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-9: assume ((#race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1 && #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-9: assume !(((#race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1 && #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1); [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-10: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-11: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-12: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-13: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-14: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-15: SUMMARY for call write~int(__VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 05:11:44,544 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-1: SUMMARY for call ULTIMATE.dealloc(push_~#casret~0#1.base, push_~#casret~0#1.offset); srcloc: null [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-2: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-3: SUMMARY for call ULTIMATE.dealloc(push_~#casret~0#1.base, push_~#casret~0#1.offset); srcloc: null [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-4: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-5: SUMMARY for call ULTIMATE.dealloc(push_~#casret~0#1.base, push_~#casret~0#1.offset); srcloc: null [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: havoc push_#t~ret14#1; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: push_~newTop~0#1 := push_#t~ret14#1; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: assume { :end_inline_index_malloc } true;assume -2147483648 <= push_#t~ret14#1 && push_#t~ret14#1 <= 2147483647; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-3: havoc index_malloc_#t~nondet11#1, index_malloc_~curr_alloc_idx~0#1; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: push_#t~ret14#1 := index_malloc_#res#1; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume 0 == push_~newTop~0#1; [2025-02-08 05:11:44,545 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume !(0 == push_~newTop~0#1); [2025-02-08 05:11:44,947 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:11:44,947 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:11:45,115 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:11:45,115 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:11:45,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:45 BoogieIcfgContainer [2025-02-08 05:11:45,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:11:45,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:11:45,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:11:45,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:11:45,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:11:43" (1/3) ... [2025-02-08 05:11:45,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2556962b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:45, skipping insertion in model container [2025-02-08 05:11:45,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:43" (2/3) ... [2025-02-08 05:11:45,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2556962b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:45, skipping insertion in model container [2025-02-08 05:11:45,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:45" (3/3) ... [2025-02-08 05:11:45,125 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-2.i [2025-02-08 05:11:45,138 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:11:45,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-2.i that has 2 procedures, 756 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-02-08 05:11:45,140 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:11:45,219 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:45,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 759 places, 758 transitions, 1520 flow [2025-02-08 05:11:45,454 INFO L124 PetriNetUnfolderBase]: 2/765 cut-off events. [2025-02-08 05:11:45,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:45,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 765 events. 2/765 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs, 0 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2025-02-08 05:11:45,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 759 places, 758 transitions, 1520 flow [2025-02-08 05:11:45,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 759 places, 758 transitions, 1520 flow [2025-02-08 05:11:45,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:45,490 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;@44ca12b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:45,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:11:45,603 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:45,603 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-08 05:11:45,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:45,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:45,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:45,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:45,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash 38766101, now seen corresponding path program 1 times [2025-02-08 05:11:45,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:45,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057896704] [2025-02-08 05:11:45,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:45,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:45,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:46,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:46,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:46,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:47,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:47,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057896704] [2025-02-08 05:11:47,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057896704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:47,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:47,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:47,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146450475] [2025-02-08 05:11:47,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:47,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:47,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:47,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:47,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:47,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 758 [2025-02-08 05:11:47,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 759 places, 758 transitions, 1520 flow. Second operand has 2 states, 2 states have (on average 741.0) internal successors, (1482), 2 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:47,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:47,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 758 [2025-02-08 05:11:47,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:48,050 INFO L124 PetriNetUnfolderBase]: 2/745 cut-off events. [2025-02-08 05:11:48,051 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:48,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 745 events. 2/745 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 7/742 useless extension candidates. Maximal degree in co-relation 84. Up to 7 conditions per place. [2025-02-08 05:11:48,054 INFO L140 encePairwiseOnDemand]: 746/758 looper letters, 6 selfloop transitions, 0 changer transitions 0/742 dead transitions. [2025-02-08 05:11:48,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 742 transitions, 1500 flow [2025-02-08 05:11:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1498 transitions. [2025-02-08 05:11:48,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9881266490765171 [2025-02-08 05:11:48,072 INFO L175 Difference]: Start difference. First operand has 759 places, 758 transitions, 1520 flow. Second operand 2 states and 1498 transitions. [2025-02-08 05:11:48,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 744 places, 742 transitions, 1500 flow [2025-02-08 05:11:48,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 742 transitions, 1500 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:48,093 INFO L231 Difference]: Finished difference. Result has 744 places, 742 transitions, 1488 flow [2025-02-08 05:11:48,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=758, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1488, PETRI_PLACES=744, PETRI_TRANSITIONS=742} [2025-02-08 05:11:48,099 INFO L279 CegarLoopForPetriNet]: 759 programPoint places, -15 predicate places. [2025-02-08 05:11:48,100 INFO L471 AbstractCegarLoop]: Abstraction has has 744 places, 742 transitions, 1488 flow [2025-02-08 05:11:48,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 741.0) internal successors, (1482), 2 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:48,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:48,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:48,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:11:48,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:11:48,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1400417863, now seen corresponding path program 1 times [2025-02-08 05:11:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:48,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406828466] [2025-02-08 05:11:48,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:48,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:48,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:48,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:48,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:48,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:48,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406828466] [2025-02-08 05:11:48,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406828466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:48,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:48,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:48,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903241013] [2025-02-08 05:11:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:48,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:48,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:48,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:48,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:48,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 758 [2025-02-08 05:11:48,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 744 places, 742 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:48,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:48,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 758 [2025-02-08 05:11:48,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:49,005 INFO L124 PetriNetUnfolderBase]: 2/794 cut-off events. [2025-02-08 05:11:49,006 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:49,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 794 events. 2/794 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 200 event pairs, 0 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 809. Up to 8 conditions per place. [2025-02-08 05:11:49,008 INFO L140 encePairwiseOnDemand]: 755/758 looper letters, 11 selfloop transitions, 2 changer transitions 0/745 dead transitions. [2025-02-08 05:11:49,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 745 transitions, 1520 flow [2025-02-08 05:11:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2222 transitions. [2025-02-08 05:11:49,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9771328056288479 [2025-02-08 05:11:49,012 INFO L175 Difference]: Start difference. First operand has 744 places, 742 transitions, 1488 flow. Second operand 3 states and 2222 transitions. [2025-02-08 05:11:49,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 745 transitions, 1520 flow [2025-02-08 05:11:49,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 745 places, 745 transitions, 1520 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:49,027 INFO L231 Difference]: Finished difference. Result has 745 places, 741 transitions, 1490 flow [2025-02-08 05:11:49,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=758, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=743, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=745, PETRI_TRANSITIONS=741} [2025-02-08 05:11:49,029 INFO L279 CegarLoopForPetriNet]: 759 programPoint places, -14 predicate places. [2025-02-08 05:11:49,029 INFO L471 AbstractCegarLoop]: Abstraction has has 745 places, 741 transitions, 1490 flow [2025-02-08 05:11:49,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:49,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:49,032 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:49,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:11:49,032 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:49,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1527223382, now seen corresponding path program 1 times [2025-02-08 05:11:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:49,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164481208] [2025-02-08 05:11:49,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:49,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-08 05:11:49,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-08 05:11:49,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:49,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:49,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:49,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-08 05:11:49,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-08 05:11:49,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:49,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:49,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:49,503 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:49,504 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2025-02-08 05:11:49,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:11:49,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:11:49,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:11:49,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:11:49,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:11:49,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:11:49,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:11:49,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:11:49,507 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:49,509 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:49,509 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:11:49,564 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:49,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 846 places, 845 transitions, 1700 flow [2025-02-08 05:11:49,679 INFO L124 PetriNetUnfolderBase]: 4/861 cut-off events. [2025-02-08 05:11:49,679 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:11:49,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 861 events. 4/861 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 623 event pairs, 0 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 766. Up to 3 conditions per place. [2025-02-08 05:11:49,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 846 places, 845 transitions, 1700 flow [2025-02-08 05:11:49,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 846 places, 845 transitions, 1700 flow [2025-02-08 05:11:49,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:49,687 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;@44ca12b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:49,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 05:11:49,800 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:49,801 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-02-08 05:11:49,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:49,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:49,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:49,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:49,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:49,803 INFO L85 PathProgramCache]: Analyzing trace with hash 747357656, now seen corresponding path program 1 times [2025-02-08 05:11:49,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:49,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507216194] [2025-02-08 05:11:49,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:49,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:50,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:50,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:50,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:51,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507216194] [2025-02-08 05:11:51,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507216194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:51,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:51,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:51,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618544832] [2025-02-08 05:11:51,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:51,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:51,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:51,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:51,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 810 out of 845 [2025-02-08 05:11:51,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 846 places, 845 transitions, 1700 flow. Second operand has 2 states, 2 states have (on average 811.0) internal successors, (1622), 2 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:51,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:51,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 810 of 845 [2025-02-08 05:11:51,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:51,852 INFO L124 PetriNetUnfolderBase]: 38/1256 cut-off events. [2025-02-08 05:11:51,852 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:11:51,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 1256 events. 38/1256 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3130 event pairs, 23 based on Foata normal form. 46/1220 useless extension candidates. Maximal degree in co-relation 752. Up to 66 conditions per place. [2025-02-08 05:11:51,861 INFO L140 encePairwiseOnDemand]: 822/845 looper letters, 12 selfloop transitions, 0 changer transitions 0/817 dead transitions. [2025-02-08 05:11:51,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 817 transitions, 1668 flow [2025-02-08 05:11:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1655 transitions. [2025-02-08 05:11:51,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9792899408284024 [2025-02-08 05:11:51,864 INFO L175 Difference]: Start difference. First operand has 846 places, 845 transitions, 1700 flow. Second operand 2 states and 1655 transitions. [2025-02-08 05:11:51,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 819 places, 817 transitions, 1668 flow [2025-02-08 05:11:51,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 819 places, 817 transitions, 1668 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:51,879 INFO L231 Difference]: Finished difference. Result has 819 places, 817 transitions, 1644 flow [2025-02-08 05:11:51,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=845, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=818, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=817, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1644, PETRI_PLACES=819, PETRI_TRANSITIONS=817} [2025-02-08 05:11:51,881 INFO L279 CegarLoopForPetriNet]: 846 programPoint places, -27 predicate places. [2025-02-08 05:11:51,882 INFO L471 AbstractCegarLoop]: Abstraction has has 819 places, 817 transitions, 1644 flow [2025-02-08 05:11:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 811.0) internal successors, (1622), 2 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:51,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:51,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:51,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:11:51,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:51,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash 951263516, now seen corresponding path program 1 times [2025-02-08 05:11:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:51,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685442630] [2025-02-08 05:11:51,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:51,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:52,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:52,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:52,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:52,143 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:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:52,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685442630] [2025-02-08 05:11:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685442630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:52,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:52,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140079242] [2025-02-08 05:11:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:52,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:52,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:52,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:52,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 802 out of 845 [2025-02-08 05:11:52,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 819 places, 817 transitions, 1644 flow. Second operand has 3 states, 3 states have (on average 803.3333333333334) internal successors, (2410), 3 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:52,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:52,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 802 of 845 [2025-02-08 05:11:52,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:52,600 INFO L124 PetriNetUnfolderBase]: 151/2444 cut-off events. [2025-02-08 05:11:52,600 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:11:52,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 2444 events. 151/2444 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 14288 event pairs, 48 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 2768. Up to 146 conditions per place. [2025-02-08 05:11:52,614 INFO L140 encePairwiseOnDemand]: 837/845 looper letters, 31 selfloop transitions, 6 changer transitions 0/834 dead transitions. [2025-02-08 05:11:52,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 834 transitions, 1757 flow [2025-02-08 05:11:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2445 transitions. [2025-02-08 05:11:52,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644970414201184 [2025-02-08 05:11:52,619 INFO L175 Difference]: Start difference. First operand has 819 places, 817 transitions, 1644 flow. Second operand 3 states and 2445 transitions. [2025-02-08 05:11:52,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 834 transitions, 1757 flow [2025-02-08 05:11:52,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 821 places, 834 transitions, 1757 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:52,629 INFO L231 Difference]: Finished difference. Result has 823 places, 823 transitions, 1696 flow [2025-02-08 05:11:52,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=845, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=819, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1696, PETRI_PLACES=823, PETRI_TRANSITIONS=823} [2025-02-08 05:11:52,630 INFO L279 CegarLoopForPetriNet]: 846 programPoint places, -23 predicate places. [2025-02-08 05:11:52,630 INFO L471 AbstractCegarLoop]: Abstraction has has 823 places, 823 transitions, 1696 flow [2025-02-08 05:11:52,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 803.3333333333334) internal successors, (2410), 3 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:52,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:52,632 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:52,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:11:52,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:11:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -995326799, now seen corresponding path program 1 times [2025-02-08 05:11:52,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:52,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313402055] [2025-02-08 05:11:52,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:52,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-08 05:11:52,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-08 05:11:52,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:52,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:52,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:52,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-08 05:11:52,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-08 05:11:52,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:52,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:53,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:53,006 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:53,006 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 52 remaining) [2025-02-08 05:11:53,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2025-02-08 05:11:53,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2025-02-08 05:11:53,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2025-02-08 05:11:53,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2025-02-08 05:11:53,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining) [2025-02-08 05:11:53,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2025-02-08 05:11:53,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2025-02-08 05:11:53,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2025-02-08 05:11:53,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2025-02-08 05:11:53,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2025-02-08 05:11:53,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:11:53,010 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:53,010 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:53,010 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:11:53,083 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:53,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 933 places, 932 transitions, 1882 flow [2025-02-08 05:11:53,215 INFO L124 PetriNetUnfolderBase]: 6/957 cut-off events. [2025-02-08 05:11:53,215 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:11:53,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 957 events. 6/957 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1183 event pairs, 0 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 865. Up to 4 conditions per place. [2025-02-08 05:11:53,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 933 places, 932 transitions, 1882 flow [2025-02-08 05:11:53,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 933 places, 932 transitions, 1882 flow [2025-02-08 05:11:53,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:53,226 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;@44ca12b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:53,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:11:53,275 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:53,275 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-08 05:11:53,275 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:53,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:53,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:53,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:53,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2016842194, now seen corresponding path program 1 times [2025-02-08 05:11:53,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:53,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714034264] [2025-02-08 05:11:53,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:53,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:53,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:53,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:53,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:54,213 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,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:54,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714034264] [2025-02-08 05:11:54,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714034264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:54,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:54,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318702347] [2025-02-08 05:11:54,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:54,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:54,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:54,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:54,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 880 out of 932 [2025-02-08 05:11:54,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 932 transitions, 1882 flow. Second operand has 2 states, 2 states have (on average 881.0) internal successors, (1762), 2 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:54,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:54,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 880 of 932 [2025-02-08 05:11:54,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:55,128 INFO L124 PetriNetUnfolderBase]: 392/4351 cut-off events. [2025-02-08 05:11:55,129 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 05:11:55,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5049 conditions, 4351 events. 392/4351 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 34619 event pairs, 294 based on Foata normal form. 306/4145 useless extension candidates. Maximal degree in co-relation 3534. Up to 561 conditions per place. [2025-02-08 05:11:55,174 INFO L140 encePairwiseOnDemand]: 898/932 looper letters, 18 selfloop transitions, 0 changer transitions 0/892 dead transitions. [2025-02-08 05:11:55,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 892 transitions, 1838 flow [2025-02-08 05:11:55,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1812 transitions. [2025-02-08 05:11:55,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9721030042918455 [2025-02-08 05:11:55,177 INFO L175 Difference]: Start difference. First operand has 933 places, 932 transitions, 1882 flow. Second operand 2 states and 1812 transitions. [2025-02-08 05:11:55,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 894 places, 892 transitions, 1838 flow [2025-02-08 05:11:55,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 894 places, 892 transitions, 1836 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:55,189 INFO L231 Difference]: Finished difference. Result has 894 places, 892 transitions, 1800 flow [2025-02-08 05:11:55,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=932, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=893, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=892, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1800, PETRI_PLACES=894, PETRI_TRANSITIONS=892} [2025-02-08 05:11:55,192 INFO L279 CegarLoopForPetriNet]: 933 programPoint places, -39 predicate places. [2025-02-08 05:11:55,192 INFO L471 AbstractCegarLoop]: Abstraction has has 894 places, 892 transitions, 1800 flow [2025-02-08 05:11:55,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 881.0) internal successors, (1762), 2 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:55,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:55,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:55,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:11:55,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:55,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:55,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1155222294, now seen corresponding path program 1 times [2025-02-08 05:11:55,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:55,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809776489] [2025-02-08 05:11:55,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:55,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:55,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:55,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:55,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:55,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:55,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809776489] [2025-02-08 05:11:55,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809776489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:55,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:55,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:55,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192124320] [2025-02-08 05:11:55,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:55,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:55,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:55,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:55,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:55,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 868 out of 932 [2025-02-08 05:11:55,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 894 places, 892 transitions, 1800 flow. Second operand has 3 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:55,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:55,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 868 of 932 [2025-02-08 05:11:55,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:59,449 INFO L124 PetriNetUnfolderBase]: 3227/21631 cut-off events. [2025-02-08 05:11:59,449 INFO L125 PetriNetUnfolderBase]: For 418/418 co-relation queries the response was YES. [2025-02-08 05:11:59,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26890 conditions, 21631 events. 3227/21631 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 279311 event pairs, 1134 based on Foata normal form. 0/18718 useless extension candidates. Maximal degree in co-relation 26884. Up to 2458 conditions per place. [2025-02-08 05:11:59,620 INFO L140 encePairwiseOnDemand]: 920/932 looper letters, 47 selfloop transitions, 9 changer transitions 0/918 dead transitions. [2025-02-08 05:11:59,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 896 places, 918 transitions, 1974 flow [2025-02-08 05:11:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2663 transitions. [2025-02-08 05:11:59,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9524320457796852 [2025-02-08 05:11:59,625 INFO L175 Difference]: Start difference. First operand has 894 places, 892 transitions, 1800 flow. Second operand 3 states and 2663 transitions. [2025-02-08 05:11:59,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 896 places, 918 transitions, 1974 flow [2025-02-08 05:11:59,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 896 places, 918 transitions, 1974 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:59,636 INFO L231 Difference]: Finished difference. Result has 898 places, 901 transitions, 1878 flow [2025-02-08 05:11:59,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=932, PETRI_DIFFERENCE_MINUEND_FLOW=1800, PETRI_DIFFERENCE_MINUEND_PLACES=894, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1878, PETRI_PLACES=898, PETRI_TRANSITIONS=901} [2025-02-08 05:11:59,638 INFO L279 CegarLoopForPetriNet]: 933 programPoint places, -35 predicate places. [2025-02-08 05:11:59,638 INFO L471 AbstractCegarLoop]: Abstraction has has 898 places, 901 transitions, 1878 flow [2025-02-08 05:11:59,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 869.3333333333334) internal successors, (2608), 3 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:59,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:59,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:59,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:11:59,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:11:59,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash 223519332, now seen corresponding path program 1 times [2025-02-08 05:11:59,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:59,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286783867] [2025-02-08 05:11:59,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:59,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-02-08 05:11:59,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-02-08 05:11:59,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:59,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:01,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:01,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286783867] [2025-02-08 05:12:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286783867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797905870] [2025-02-08 05:12:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:01,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:01,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:01,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:01,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 859 out of 932 [2025-02-08 05:12:01,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 898 places, 901 transitions, 1878 flow. Second operand has 6 states, 6 states have (on average 860.6666666666666) internal successors, (5164), 6 states have internal predecessors, (5164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:01,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:01,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 859 of 932 [2025-02-08 05:12:01,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:05,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [936#true, 281#L793-2true, 934#true, 932#true, 194#L785-1true, 32#L734-1true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:05,814 INFO L294 olderBase$Statistics]: this new event has 723 ancestors and is cut-off event [2025-02-08 05:12:05,814 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-08 05:12:05,814 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-08 05:12:05,814 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-08 05:12:05,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 827#L781-1true, 194#L785-1true, 930#true, 940#(= |#race~state~0| 0), 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:05,979 INFO L294 olderBase$Statistics]: this new event has 724 ancestors and is cut-off event [2025-02-08 05:12:05,980 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:12:05,980 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-08 05:12:05,980 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-08 05:12:06,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 194#L785-1true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true, 564#L781true]) [2025-02-08 05:12:06,148 INFO L294 olderBase$Statistics]: this new event has 725 ancestors and is cut-off event [2025-02-08 05:12:06,148 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-08 05:12:06,148 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-08 05:12:06,148 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:12:07,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 626#L734-3true, 234#L782-2true, 930#true, 940#(= |#race~state~0| 0), 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:07,039 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-02-08 05:12:07,039 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:12:07,039 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:12:07,039 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:12:07,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 234#L782-2true, 930#true, 940#(= |#race~state~0| 0), 263#L734-2true, Black: 938#true, 52#L785-1true, 943#true]) [2025-02-08 05:12:07,202 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-02-08 05:12:07,202 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:12:07,202 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:12:07,202 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:12:07,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 21#L734true, 234#L782-2true, 930#true, 940#(= |#race~state~0| 0), 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:07,369 INFO L294 olderBase$Statistics]: this new event has 732 ancestors and is cut-off event [2025-02-08 05:12:07,369 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-08 05:12:07,369 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-08 05:12:07,369 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-08 05:12:07,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 234#L782-2true, 930#true, 940#(= |#race~state~0| 0), Black: 938#true, 52#L785-1true, 285#L734-1true, 943#true]) [2025-02-08 05:12:07,543 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-02-08 05:12:07,543 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-08 05:12:07,543 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-08 05:12:07,543 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-08 05:12:08,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 235#L723-2true, 104#L734-4true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:08,421 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-02-08 05:12:08,421 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-08 05:12:08,421 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-08 05:12:08,421 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-08 05:12:08,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 235#L723-2true, 48#L734-3true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:08,584 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-02-08 05:12:08,585 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:12:08,585 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-02-08 05:12:08,585 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:12:08,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 235#L723-2true, 31#L734-2true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:08,752 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-02-08 05:12:08,752 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:12:08,752 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-02-08 05:12:08,753 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:12:08,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 235#L723-2true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true, 713#L734true]) [2025-02-08 05:12:08,921 INFO L294 olderBase$Statistics]: this new event has 740 ancestors and is cut-off event [2025-02-08 05:12:08,921 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-08 05:12:08,921 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-08 05:12:08,921 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-02-08 05:12:09,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [936#true, 281#L793-2true, 934#true, 932#true, 235#L723-2true, 32#L734-1true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 52#L785-1true, 943#true]) [2025-02-08 05:12:09,305 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:09,305 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:09,305 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:09,305 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:09,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 235#L723-2true, 32#L734-1true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:09,306 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:09,306 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:09,306 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:09,306 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:09,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 235#L723-2true, 722#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:09,307 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:09,307 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:09,307 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:09,307 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:09,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 83#L725true, 104#L734-4true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:09,312 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:09,312 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:09,312 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:09,312 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:09,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 827#L781-1true, 235#L723-2true, 930#true, 940#(= |#race~state~0| 0), 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:09,534 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-08 05:12:09,534 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-08 05:12:09,534 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:09,534 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:09,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 83#L725true, 48#L734-3true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 52#L785-1true, 943#true]) [2025-02-08 05:12:09,537 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-08 05:12:09,537 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-08 05:12:09,537 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:09,537 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:09,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 235#L723-2true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true, 564#L781true]) [2025-02-08 05:12:09,730 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-08 05:12:09,730 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:12:09,730 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:09,730 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:09,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 83#L725true, 31#L734-2true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:09,733 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-08 05:12:09,733 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:09,733 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:09,733 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:12:09,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 83#L725true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true, 713#L734true]) [2025-02-08 05:12:09,933 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-02-08 05:12:09,933 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-02-08 05:12:09,933 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-02-08 05:12:09,933 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-02-08 05:12:10,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [936#true, 281#L793-2true, 934#true, 932#true, 83#L725true, 32#L734-1true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 52#L785-1true, 943#true]) [2025-02-08 05:12:10,149 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,149 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,149 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,149 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 83#L725true, 32#L734-1true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 52#L785-1true, 943#true]) [2025-02-08 05:12:10,150 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,150 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,150 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,150 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 83#L725true, 722#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,151 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,151 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:12:10,151 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,151 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:10,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 827#L781-1true, 83#L725true, 930#true, 940#(= |#race~state~0| 0), 52#L785-1true, Black: 938#true, 943#true]) [2025-02-08 05:12:10,344 INFO L294 olderBase$Statistics]: this new event has 746 ancestors and is cut-off event [2025-02-08 05:12:10,344 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:12:10,344 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:12:10,344 INFO L297 olderBase$Statistics]: existing Event has 746 ancestors and is cut-off event [2025-02-08 05:12:10,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 83#L725true, 940#(= |#race~state~0| 0), 930#true, 52#L785-1true, Black: 938#true, 943#true, 564#L781true]) [2025-02-08 05:12:10,545 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-02-08 05:12:10,545 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:12:10,545 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:12:10,545 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-02-08 05:12:11,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([3754] L784-4-->L785-1: Formula: (let ((.cse0 (select |v_#race_611| |v_~#m2~0.base_19|)) (.cse4 (+ |v_~#m2~0.offset_19| 3))) (let ((.cse1 (+ |v_~#m2~0.offset_19| 1)) (.cse5 (select |v_#memory_int_187| |v_~#m2~0.base_19|)) (.cse3 (+ |v_~#m2~0.offset_19| 2)) (.cse2 (select .cse0 .cse4))) (and (= (select .cse0 .cse1) .cse2) (= |v_#race_611| (store |v_#race_613| |v_~#m2~0.base_19| (store (store (store (store (select |v_#race_613| |v_~#m2~0.base_19|) |v_~#m2~0.offset_19| .cse2) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2))) (= |v_#memory_int_186| (store |v_#memory_int_187| |v_~#m2~0.base_19| (store .cse5 |v_~#m2~0.offset_19| 0))) (= (select .cse0 |v_~#m2~0.offset_19|) .cse2) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_19|) 1) 1 0) 0)) (= (select .cse0 .cse3) .cse2)))) InVars {#race=|v_#race_613|, #memory_int=|v_#memory_int_187|, ~#m2~0.base=|v_~#m2~0.base_19|, ~#m2~0.offset=|v_~#m2~0.offset_19|} OutVars{#race=|v_#race_611|, 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_186|, ~#m2~0.base=|v_~#m2~0.base_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_19|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [936#true, 281#L793-2true, 934#true, 932#true, 722#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 494#L731-1true, 940#(= |#race~state~0| 0), 930#true, Black: 938#true, 52#L785-1true, 943#true]) [2025-02-08 05:12:11,697 INFO L294 olderBase$Statistics]: this new event has 755 ancestors and is cut-off event [2025-02-08 05:12:11,697 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2025-02-08 05:12:11,698 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:11,698 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,990 INFO L124 PetriNetUnfolderBase]: 13850/59070 cut-off events. [2025-02-08 05:12:12,990 INFO L125 PetriNetUnfolderBase]: For 1961/1966 co-relation queries the response was YES. [2025-02-08 05:12:13,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83290 conditions, 59070 events. 13850/59070 cut-off events. For 1961/1966 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 854617 event pairs, 5973 based on Foata normal form. 0/51604 useless extension candidates. Maximal degree in co-relation 83282. Up to 16407 conditions per place. [2025-02-08 05:12:13,599 INFO L140 encePairwiseOnDemand]: 905/932 looper letters, 72 selfloop transitions, 78 changer transitions 0/1012 dead transitions. [2025-02-08 05:12:13,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 1012 transitions, 2440 flow [2025-02-08 05:12:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:12:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:12:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5305 transitions. [2025-02-08 05:12:13,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486766809728183 [2025-02-08 05:12:13,606 INFO L175 Difference]: Start difference. First operand has 898 places, 901 transitions, 1878 flow. Second operand 6 states and 5305 transitions. [2025-02-08 05:12:13,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 1012 transitions, 2440 flow [2025-02-08 05:12:13,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 1012 transitions, 2422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:12:13,629 INFO L231 Difference]: Finished difference. Result has 905 places, 982 transitions, 2344 flow [2025-02-08 05:12:13,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=932, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=896, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2344, PETRI_PLACES=905, PETRI_TRANSITIONS=982} [2025-02-08 05:12:13,631 INFO L279 CegarLoopForPetriNet]: 933 programPoint places, -28 predicate places. [2025-02-08 05:12:13,631 INFO L471 AbstractCegarLoop]: Abstraction has has 905 places, 982 transitions, 2344 flow [2025-02-08 05:12:13,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 860.6666666666666) internal successors, (5164), 6 states have internal predecessors, (5164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:13,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:13,634 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:13,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:12:13,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-02-08 05:12:13,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1125653212, now seen corresponding path program 1 times [2025-02-08 05:12:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:13,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801279509] [2025-02-08 05:12:13,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:13,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-08 05:12:13,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-08 05:12:13,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:13,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:13,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:13,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-08 05:12:13,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-08 05:12:13,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:13,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:13,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:13,904 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:13,904 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 69 remaining) [2025-02-08 05:12:13,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:12:13,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:12:13,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:12:13,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:12:13,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:12:13,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:12:13,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:12:13,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:12:13,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:12:13,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:12:13,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:12:13,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:12:13,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:12:13,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:12:13,909 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:12:13,909 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:13,909 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:12:14,196 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:14,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1020 places, 1019 transitions, 2066 flow [2025-02-08 05:12:14,342 INFO L124 PetriNetUnfolderBase]: 8/1053 cut-off events. [2025-02-08 05:12:14,342 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:12:14,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 1053 events. 8/1053 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1799 event pairs, 0 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 965. Up to 5 conditions per place. [2025-02-08 05:12:14,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 1020 places, 1019 transitions, 2066 flow [2025-02-08 05:12:14,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1020 places, 1019 transitions, 2066 flow [2025-02-08 05:12:14,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:14,355 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;@44ca12b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:14,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 05:12:14,391 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:14,392 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-08 05:12:14,392 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:12:14,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:14,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:14,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2025-02-08 05:12:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash -447742077, now seen corresponding path program 1 times [2025-02-08 05:12:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:14,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824672792] [2025-02-08 05:12:14,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:14,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:14,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:12:14,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:12:14,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:14,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:15,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824672792] [2025-02-08 05:12:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824672792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:15,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:12:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615326140] [2025-02-08 05:12:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:15,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:12:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:15,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:12:15,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:12:15,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 950 out of 1019 [2025-02-08 05:12:15,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1019 transitions, 2066 flow. Second operand has 2 states, 2 states have (on average 951.0) internal successors, (1902), 2 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:15,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:15,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 950 of 1019 [2025-02-08 05:12:15,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:20,823 INFO L124 PetriNetUnfolderBase]: 3368/23452 cut-off events. [2025-02-08 05:12:20,824 INFO L125 PetriNetUnfolderBase]: For 1926/1926 co-relation queries the response was YES. [2025-02-08 05:12:20,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28848 conditions, 23452 events. 3368/23452 cut-off events. For 1926/1926 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 301966 event pairs, 2768 based on Foata normal form. 2036/22418 useless extension candidates. Maximal degree in co-relation 22590. Up to 4393 conditions per place. [2025-02-08 05:12:21,057 INFO L140 encePairwiseOnDemand]: 974/1019 looper letters, 24 selfloop transitions, 0 changer transitions 0/967 dead transitions. [2025-02-08 05:12:21,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 967 transitions, 2010 flow [2025-02-08 05:12:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:12:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:12:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1969 transitions. [2025-02-08 05:12:21,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661432777232581 [2025-02-08 05:12:21,060 INFO L175 Difference]: Start difference. First operand has 1020 places, 1019 transitions, 2066 flow. Second operand 2 states and 1969 transitions. [2025-02-08 05:12:21,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 967 transitions, 2010 flow [2025-02-08 05:12:21,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 969 places, 967 transitions, 2004 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:12:21,070 INFO L231 Difference]: Finished difference. Result has 969 places, 967 transitions, 1956 flow [2025-02-08 05:12:21,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1019, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=968, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=967, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1956, PETRI_PLACES=969, PETRI_TRANSITIONS=967} [2025-02-08 05:12:21,072 INFO L279 CegarLoopForPetriNet]: 1020 programPoint places, -51 predicate places. [2025-02-08 05:12:21,072 INFO L471 AbstractCegarLoop]: Abstraction has has 969 places, 967 transitions, 1956 flow [2025-02-08 05:12:21,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 951.0) internal successors, (1902), 2 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:21,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:21,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:12:21,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:12:21,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 82 more)] === [2025-02-08 05:12:21,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash -783246681, now seen corresponding path program 1 times [2025-02-08 05:12:21,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:21,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331983983] [2025-02-08 05:12:21,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:21,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:21,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:12:21,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:12:21,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:21,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:12:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331983983] [2025-02-08 05:12:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331983983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:21,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:12:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861521953] [2025-02-08 05:12:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:21,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:12:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:21,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:12:21,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:12:21,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 934 out of 1019 [2025-02-08 05:12:21,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 969 places, 967 transitions, 1956 flow. Second operand has 3 states, 3 states have (on average 935.3333333333334) internal successors, (2806), 3 states have internal predecessors, (2806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:12:21,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:21,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 934 of 1019 [2025-02-08 05:12:21,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand