./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1.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-1.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 f66a662852389d8ac1f64241746e843d67de7f5d7507051fb5c8e68404b785cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:11:37,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:11:37,866 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:37,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:11:37,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:11:37,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:11:37,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:11:37,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:11:37,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:11:37,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:11:37,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:11:37,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:11:37,901 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:11:37,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:11:37,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:11:37,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:11:37,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:11:37,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:11:37,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:11:37,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:11:37,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:11:37,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:37,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:11:37,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:11:37,904 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:11:37,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:11:37,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:11:37,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:11:37,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:11:37,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:11:37,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:11:37,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:11:37,905 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 -> f66a662852389d8ac1f64241746e843d67de7f5d7507051fb5c8e68404b785cd [2025-02-08 05:11:38,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:11:38,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:11:38,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:11:38,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:11:38,205 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:11:38,207 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-1.i [2025-02-08 05:11:39,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f9925e8d/689e59e5d37446cf8f15b98eb4706727/FLAG3e3ce3063 [2025-02-08 05:11:39,769 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:11:39,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1.i [2025-02-08 05:11:39,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f9925e8d/689e59e5d37446cf8f15b98eb4706727/FLAG3e3ce3063 [2025-02-08 05:11:39,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f9925e8d/689e59e5d37446cf8f15b98eb4706727 [2025-02-08 05:11:39,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:11:39,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:11:39,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:39,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:11:39,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:11:39,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:39" (1/1) ... [2025-02-08 05:11:39,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13939c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:39, skipping insertion in model container [2025-02-08 05:11:39,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:39" (1/1) ... [2025-02-08 05:11:39,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:11:40,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:40,243 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:11:40,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:40,346 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:11:40,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:40 WrapperNode [2025-02-08 05:11:40,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:40,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:40,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:11:40,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:11:40,356 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:40" (1/1) ... [2025-02-08 05:11:40,392 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:40" (1/1) ... [2025-02-08 05:11:40,433 INFO L138 Inliner]: procedures = 179, calls = 47, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 954 [2025-02-08 05:11:40,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:40,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:11:40,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:11:40,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:11:40,442 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:40" (1/1) ... [2025-02-08 05:11:40,442 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:40" (1/1) ... [2025-02-08 05:11:40,455 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:40" (1/1) ... [2025-02-08 05:11:40,455 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:40" (1/1) ... [2025-02-08 05:11:40,488 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:40" (1/1) ... [2025-02-08 05:11:40,497 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:40" (1/1) ... [2025-02-08 05:11:40,503 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:40" (1/1) ... [2025-02-08 05:11:40,509 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:40" (1/1) ... [2025-02-08 05:11:40,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:11:40,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:11:40,519 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:11:40,519 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:11:40,520 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:40" (1/1) ... [2025-02-08 05:11:40,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:40,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:11:40,555 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:40,562 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:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:11:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:11:40,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:11:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:11:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:11:40,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:11:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:11:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:11:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:11:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:11:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:11:40,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:11:40,584 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:40,725 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:11:40,726 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:11:41,269 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:41,270 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:41,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: push_#res#1 := 0; [2025-02-08 05:11:41,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-1: havoc __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:41,270 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:41,270 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:41,270 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:41,270 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:41,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-6: havoc __VERIFIER_atomic_CAS_#t~nondet10#1; [2025-02-08 05:11:41,270 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:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:11:41,271 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:41,271 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:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-3: havoc __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-4: havoc __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-5: assume !!__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-5: assume !!!__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-6: havoc __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-7: havoc __VERIFIER_atomic_assert_#t~ret19#1; [2025-02-08 05:11:41,271 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:41,271 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:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-10: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-11: __VERIFIER_atomic_assert_#t~ret19#1 := isEmpty_#res#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-12: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-13: assume __VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-13: assume !__VERIFIER_atomic_assert_#t~short20#1; [2025-02-08 05:11:41,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L763-14: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 05:11:41,271 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:41,272 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:41,272 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:41,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: havoc push_#t~nondet15#1; [2025-02-08 05:11:41,272 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:41,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-3: havoc push_#t~nondet15#1; [2025-02-08 05:11:41,272 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:41,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume true; [2025-02-08 05:11:41,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume !true; [2025-02-08 05:11:41,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: [2025-02-08 05:11:41,272 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:41,272 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:41,272 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:41,272 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:41,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc push_#t~mem16#1; [2025-02-08 05:11:41,272 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:41,272 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:41,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-2: push_~oldTop~0#1 := push_#t~mem16#1; [2025-02-08 05:11:41,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-3: #race := #race[~#top~0.base,3 + ~#top~0.offset := 0]; [2025-02-08 05:11:41,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-4: #race := #race[~#top~0.base,2 + ~#top~0.offset := 0]; [2025-02-08 05:11:41,273 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-5: #race := #race[~#top~0.base,1 + ~#top~0.offset := 0]; [2025-02-08 05:11:41,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-6: #race := #race[~#top~0.base,~#top~0.offset := 0]; [2025-02-08 05:11:41,274 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:41,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L752: [2025-02-08 05:11:41,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc push_loop_#t~ret22#1; [2025-02-08 05:11:41,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-1: push_loop_~r~0#1 := push_loop_#t~ret22#1; [2025-02-08 05:11:41,274 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:41,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-3: havoc push_#in~d#1; [2025-02-08 05:11:41,274 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:41,274 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769-5: push_loop_#t~ret22#1 := push_#res#1; [2025-02-08 05:11:41,275 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:41,275 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:41,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-1: havoc push_#t~nondet17#1; [2025-02-08 05:11:41,275 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:41,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-3: havoc push_#t~nondet17#1; [2025-02-08 05:11:41,275 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:41,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: [2025-02-08 05:11:41,275 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:41,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: assume 0 == isEmpty_#t~mem13#1; [2025-02-08 05:11:41,275 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: assume !(0 == isEmpty_#t~mem13#1); [2025-02-08 05:11:41,276 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:41,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-1: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:41,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-2: havoc isEmpty_#t~mem13#1; [2025-02-08 05:11:41,276 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:41,276 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:41,276 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:41,276 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:41,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-4: #race := #race[~#top~0.base,3 + ~#top~0.offset := 0]; [2025-02-08 05:11:41,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-5: #race := #race[~#top~0.base,2 + ~#top~0.offset := 0]; [2025-02-08 05:11:41,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-6: #race := #race[~#top~0.base,1 + ~#top~0.offset := 0]; [2025-02-08 05:11:41,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737-7: #race := #race[~#top~0.base,~#top~0.offset := 0]; [2025-02-08 05:11:41,277 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:41,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754: [2025-02-08 05:11:41,277 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:41,277 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:41,277 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:41,277 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:41,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L738-1: isEmpty_#res#1 := 1; [2025-02-08 05:11:41,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755: assume 1 == push_#t~mem18#1; [2025-02-08 05:11:41,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755: assume !(1 == push_#t~mem18#1); [2025-02-08 05:11:41,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-1: havoc push_#t~mem18#1; [2025-02-08 05:11:41,278 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-2: havoc push_#t~mem18#1; [2025-02-08 05:11:41,278 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:41,278 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:41,278 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:41,278 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:41,278 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:41,278 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:41,279 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:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L756-1: push_#res#1 := 1; [2025-02-08 05:11:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L740-1: isEmpty_#res#1 := 0; [2025-02-08 05:11:41,279 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:41,279 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:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: havoc __VERIFIER_atomic_CAS_#t~mem7#1; [2025-02-08 05:11:41,279 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-2: havoc __VERIFIER_atomic_CAS_#t~mem7#1; [2025-02-08 05:11:41,279 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:41,279 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:41,279 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:41,280 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:41,280 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:41,280 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:41,280 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:41,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:41,280 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:41,280 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:41,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-2: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:41,280 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:41,280 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:41,280 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:41,280 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:41,280 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-7: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:11:41,280 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:41,280 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:41,281 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:41,281 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:41,281 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:41,281 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:41,281 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:41,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-14: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:11:41,281 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:41,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: havoc push_~#casret~0#1.base, push_~#casret~0#1.offset; [2025-02-08 05:11:41,281 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:41,281 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:41,281 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:41,281 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:41,281 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:41,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 05:11:41,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 05:11:41,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 05:11:41,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: havoc push_#t~ret14#1; [2025-02-08 05:11:41,281 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-1: push_~newTop~0#1 := push_#t~ret14#1; [2025-02-08 05:11:41,281 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:41,281 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:41,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: push_#t~ret14#1 := index_malloc_#res#1; [2025-02-08 05:11:41,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 05:11:41,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume 0 == push_~newTop~0#1; [2025-02-08 05:11:41,282 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume !(0 == push_~newTop~0#1); [2025-02-08 05:11:41,820 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:11:41,821 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:11:42,039 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:11:42,039 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:11:42,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:42 BoogieIcfgContainer [2025-02-08 05:11:42,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:11:42,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:11:42,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:11:42,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:11:42,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:11:39" (1/3) ... [2025-02-08 05:11:42,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5cf7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:42, skipping insertion in model container [2025-02-08 05:11:42,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:40" (2/3) ... [2025-02-08 05:11:42,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5cf7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:42, skipping insertion in model container [2025-02-08 05:11:42,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:42" (3/3) ... [2025-02-08 05:11:42,048 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2025-02-08 05:11:42,062 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:11:42,065 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-1.i that has 2 procedures, 756 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-02-08 05:11:42,065 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:11:42,168 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:42,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 759 places, 758 transitions, 1520 flow [2025-02-08 05:11:42,519 INFO L124 PetriNetUnfolderBase]: 2/765 cut-off events. [2025-02-08 05:11:42,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:42,529 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:42,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 759 places, 758 transitions, 1520 flow [2025-02-08 05:11:42,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 759 places, 758 transitions, 1520 flow [2025-02-08 05:11:42,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:42,565 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;@725eaae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:42,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:11:42,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:42,712 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-08 05:11:42,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:42,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:42,714 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:42,714 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:42,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash 38766101, now seen corresponding path program 1 times [2025-02-08 05:11:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:42,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249937985] [2025-02-08 05:11:42,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:42,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:43,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:43,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:43,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:45,775 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:45,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:45,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249937985] [2025-02-08 05:11:45,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249937985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:45,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:45,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:45,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821348397] [2025-02-08 05:11:45,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:45,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:45,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:45,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 758 [2025-02-08 05:11:45,842 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:45,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:45,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 758 [2025-02-08 05:11:45,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:46,093 INFO L124 PetriNetUnfolderBase]: 2/745 cut-off events. [2025-02-08 05:11:46,093 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:46,094 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:46,097 INFO L140 encePairwiseOnDemand]: 746/758 looper letters, 6 selfloop transitions, 0 changer transitions 0/742 dead transitions. [2025-02-08 05:11:46,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 744 places, 742 transitions, 1500 flow [2025-02-08 05:11:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1498 transitions. [2025-02-08 05:11:46,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9881266490765171 [2025-02-08 05:11:46,122 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:46,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 744 places, 742 transitions, 1500 flow [2025-02-08 05:11:46,134 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:46,151 INFO L231 Difference]: Finished difference. Result has 744 places, 742 transitions, 1488 flow [2025-02-08 05:11:46,154 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:46,158 INFO L279 CegarLoopForPetriNet]: 759 programPoint places, -15 predicate places. [2025-02-08 05:11:46,159 INFO L471 AbstractCegarLoop]: Abstraction has has 744 places, 742 transitions, 1488 flow [2025-02-08 05:11:46,161 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:46,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:46,161 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:46,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:11:46,162 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:46,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:46,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1400417863, now seen corresponding path program 1 times [2025-02-08 05:11:46,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:46,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663398503] [2025-02-08 05:11:46,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:46,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:46,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:46,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:46,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:46,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:47,030 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,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:47,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663398503] [2025-02-08 05:11:47,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663398503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:47,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450210154] [2025-02-08 05:11:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:47,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:47,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:47,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:47,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 758 [2025-02-08 05:11:47,051 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:47,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:47,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 758 [2025-02-08 05:11:47,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:47,252 INFO L124 PetriNetUnfolderBase]: 2/794 cut-off events. [2025-02-08 05:11:47,252 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:47,253 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:47,256 INFO L140 encePairwiseOnDemand]: 755/758 looper letters, 11 selfloop transitions, 2 changer transitions 0/745 dead transitions. [2025-02-08 05:11:47,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 745 transitions, 1520 flow [2025-02-08 05:11:47,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2222 transitions. [2025-02-08 05:11:47,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9771328056288479 [2025-02-08 05:11:47,266 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:47,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 745 transitions, 1520 flow [2025-02-08 05:11:47,271 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:47,283 INFO L231 Difference]: Finished difference. Result has 745 places, 741 transitions, 1490 flow [2025-02-08 05:11:47,284 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:47,285 INFO L279 CegarLoopForPetriNet]: 759 programPoint places, -14 predicate places. [2025-02-08 05:11:47,285 INFO L471 AbstractCegarLoop]: Abstraction has has 745 places, 741 transitions, 1490 flow [2025-02-08 05:11:47,287 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:47,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:47,287 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:47,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:11:47,287 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:47,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1527223382, now seen corresponding path program 1 times [2025-02-08 05:11:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:47,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417577750] [2025-02-08 05:11:47,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:47,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:47,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-08 05:11:47,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-08 05:11:47,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:47,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:47,532 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:47,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-08 05:11:47,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-08 05:11:47,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:47,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:47,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:47,898 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:47,899 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2025-02-08 05:11:47,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:11:47,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:11:47,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:11:47,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:11:47,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:11:47,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:11:47,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:11:47,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:11:47,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:11:47,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:11:47,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:11:47,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:11:47,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:11:47,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:11:47,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:11:47,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:11:47,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:11:47,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:11:47,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-02-08 05:11:47,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-02-08 05:11:47,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-02-08 05:11:47,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:11:47,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 35 remaining) [2025-02-08 05:11:47,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 35 remaining) [2025-02-08 05:11:47,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:11:47,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:11:47,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:11:47,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:11:47,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:11:47,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:11:47,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:11:47,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:11:47,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:11:47,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:11:47,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:11:47,909 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:47,911 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:47,912 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:11:48,055 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:48,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 846 places, 845 transitions, 1700 flow [2025-02-08 05:11:48,238 INFO L124 PetriNetUnfolderBase]: 4/861 cut-off events. [2025-02-08 05:11:48,239 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:11:48,243 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:48,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 846 places, 845 transitions, 1700 flow [2025-02-08 05:11:48,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 846 places, 845 transitions, 1700 flow [2025-02-08 05:11:48,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:48,252 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;@725eaae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:48,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 05:11:48,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:48,333 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-02-08 05:11:48,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:48,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:48,334 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:48,334 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:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 747357656, now seen corresponding path program 1 times [2025-02-08 05:11:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553825788] [2025-02-08 05:11:48,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:48,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:48,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:48,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:11:48,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:48,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:50,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553825788] [2025-02-08 05:11:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553825788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:50,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:50,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168670846] [2025-02-08 05:11:50,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:50,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:50,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:50,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 810 out of 845 [2025-02-08 05:11:50,610 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:50,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:50,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 810 of 845 [2025-02-08 05:11:50,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:50,984 INFO L124 PetriNetUnfolderBase]: 38/1256 cut-off events. [2025-02-08 05:11:50,984 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:11:50,989 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:50,995 INFO L140 encePairwiseOnDemand]: 822/845 looper letters, 12 selfloop transitions, 0 changer transitions 0/817 dead transitions. [2025-02-08 05:11:50,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 817 transitions, 1668 flow [2025-02-08 05:11:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1655 transitions. [2025-02-08 05:11:51,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9792899408284024 [2025-02-08 05:11:51,002 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,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 819 places, 817 transitions, 1668 flow [2025-02-08 05:11:51,008 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,019 INFO L231 Difference]: Finished difference. Result has 819 places, 817 transitions, 1644 flow [2025-02-08 05:11:51,020 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,022 INFO L279 CegarLoopForPetriNet]: 846 programPoint places, -27 predicate places. [2025-02-08 05:11:51,023 INFO L471 AbstractCegarLoop]: Abstraction has has 819 places, 817 transitions, 1644 flow [2025-02-08 05:11:51,024 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,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:51,024 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,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:11:51,025 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,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash 951263516, now seen corresponding path program 1 times [2025-02-08 05:11:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:51,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393345703] [2025-02-08 05:11:51,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:51,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:51,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:11:51,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:51,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:51,423 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,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:51,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393345703] [2025-02-08 05:11:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393345703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:51,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:51,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:51,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379002397] [2025-02-08 05:11:51,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:51,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:51,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:51,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:51,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 802 out of 845 [2025-02-08 05:11:51,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 819 places, 817 transitions, 1644 flow. Second operand has 3 states, 3 states have (on average 803.3333333333334) internal successors, (2410), 3 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:11:51,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:51,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 802 of 845 [2025-02-08 05:11:51,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:52,087 INFO L124 PetriNetUnfolderBase]: 151/2444 cut-off events. [2025-02-08 05:11:52,088 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:11:52,099 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,110 INFO L140 encePairwiseOnDemand]: 837/845 looper letters, 31 selfloop transitions, 6 changer transitions 0/834 dead transitions. [2025-02-08 05:11:52,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 834 transitions, 1757 flow [2025-02-08 05:11:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2445 transitions. [2025-02-08 05:11:52,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644970414201184 [2025-02-08 05:11:52,117 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,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 834 transitions, 1757 flow [2025-02-08 05:11:52,122 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,132 INFO L231 Difference]: Finished difference. Result has 823 places, 823 transitions, 1696 flow [2025-02-08 05:11:52,133 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,134 INFO L279 CegarLoopForPetriNet]: 846 programPoint places, -23 predicate places. [2025-02-08 05:11:52,134 INFO L471 AbstractCegarLoop]: Abstraction has has 823 places, 823 transitions, 1696 flow [2025-02-08 05:11:52,136 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,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:52,137 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,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:11:52,137 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,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash -995326799, now seen corresponding path program 1 times [2025-02-08 05:11:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077085708] [2025-02-08 05:11:52,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:52,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-08 05:11:52,377 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,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:52,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:52,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:52,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-08 05:11:52,480 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,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:52,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:52,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:52,599 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:52,599 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2025-02-08 05:11:52,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2025-02-08 05:11:52,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2025-02-08 05:11:52,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2025-02-08 05:11:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2025-02-08 05:11:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2025-02-08 05:11:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2025-02-08 05:11:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2025-02-08 05:11:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2025-02-08 05:11:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2025-02-08 05:11:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2025-02-08 05:11:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2025-02-08 05:11:52,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2025-02-08 05:11:52,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:11:52,603 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:52,604 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:52,604 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:11:52,708 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:52,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 933 places, 932 transitions, 1882 flow [2025-02-08 05:11:52,925 INFO L124 PetriNetUnfolderBase]: 6/957 cut-off events. [2025-02-08 05:11:52,925 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:11:52,931 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:52,932 INFO L82 GeneralOperation]: Start removeDead. Operand has 933 places, 932 transitions, 1882 flow [2025-02-08 05:11:52,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 933 places, 932 transitions, 1882 flow [2025-02-08 05:11:52,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:52,944 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;@725eaae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:52,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 05:11:53,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:53,014 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-08 05:11:53,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:53,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:53,015 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,016 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,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2016842194, now seen corresponding path program 1 times [2025-02-08 05:11:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:53,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242348571] [2025-02-08 05:11:53,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:53,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:11:53,276 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,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:53,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:54,486 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,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:54,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242348571] [2025-02-08 05:11:54,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242348571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:54,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:54,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:11:54,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544177359] [2025-02-08 05:11:54,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:54,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:11:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:54,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:11:54,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:11:54,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 880 out of 932 [2025-02-08 05:11:54,494 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,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:54,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 880 of 932 [2025-02-08 05:11:54,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:55,592 INFO L124 PetriNetUnfolderBase]: 392/4351 cut-off events. [2025-02-08 05:11:55,593 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-02-08 05:11:55,626 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,656 INFO L140 encePairwiseOnDemand]: 898/932 looper letters, 18 selfloop transitions, 0 changer transitions 0/892 dead transitions. [2025-02-08 05:11:55,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 892 transitions, 1838 flow [2025-02-08 05:11:55,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:11:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:11:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1812 transitions. [2025-02-08 05:11:55,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9721030042918455 [2025-02-08 05:11:55,662 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,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 894 places, 892 transitions, 1838 flow [2025-02-08 05:11:55,667 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,676 INFO L231 Difference]: Finished difference. Result has 894 places, 892 transitions, 1800 flow [2025-02-08 05:11:55,677 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,679 INFO L279 CegarLoopForPetriNet]: 933 programPoint places, -39 predicate places. [2025-02-08 05:11:55,680 INFO L471 AbstractCegarLoop]: Abstraction has has 894 places, 892 transitions, 1800 flow [2025-02-08 05:11:55,681 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,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:55,681 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,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:11:55,682 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,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1155222294, now seen corresponding path program 1 times [2025-02-08 05:11:55,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:55,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061483588] [2025-02-08 05:11:55,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:55,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:11:55,825 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,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:55,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:56,023 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:56,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:56,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061483588] [2025-02-08 05:11:56,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061483588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:56,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:56,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755566248] [2025-02-08 05:11:56,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:56,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:56,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:56,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:56,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 868 out of 932 [2025-02-08 05:11:56,058 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:56,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:56,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 868 of 932 [2025-02-08 05:11:56,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:00,570 INFO L124 PetriNetUnfolderBase]: 3227/21631 cut-off events. [2025-02-08 05:12:00,570 INFO L125 PetriNetUnfolderBase]: For 418/418 co-relation queries the response was YES. [2025-02-08 05:12:00,666 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:12:00,778 INFO L140 encePairwiseOnDemand]: 920/932 looper letters, 47 selfloop transitions, 9 changer transitions 0/918 dead transitions. [2025-02-08 05:12:00,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 896 places, 918 transitions, 1974 flow [2025-02-08 05:12:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:12:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:12:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2663 transitions. [2025-02-08 05:12:00,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9524320457796852 [2025-02-08 05:12:00,786 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:12:00,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 896 places, 918 transitions, 1974 flow [2025-02-08 05:12:00,793 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:12:00,804 INFO L231 Difference]: Finished difference. Result has 898 places, 901 transitions, 1878 flow [2025-02-08 05:12:00,806 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:12:00,808 INFO L279 CegarLoopForPetriNet]: 933 programPoint places, -35 predicate places. [2025-02-08 05:12:00,809 INFO L471 AbstractCegarLoop]: Abstraction has has 898 places, 901 transitions, 1878 flow [2025-02-08 05:12:00,810 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:12:00,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:00,811 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:12:00,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:12:00,811 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:12:00,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash 223519332, now seen corresponding path program 1 times [2025-02-08 05:12:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130758395] [2025-02-08 05:12:00,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:00,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-02-08 05:12:01,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-02-08 05:12:01,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:01,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:03,433 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:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130758395] [2025-02-08 05:12:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130758395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:03,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:03,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:12:03,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8483565] [2025-02-08 05:12:03,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:03,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:12:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:03,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:12:03,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:12:03,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 859 out of 932 [2025-02-08 05:12:03,544 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:03,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:03,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 859 of 932 [2025-02-08 05:12:03,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:08,275 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:08,275 INFO L294 olderBase$Statistics]: this new event has 723 ancestors and is cut-off event [2025-02-08 05:12:08,275 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-08 05:12:08,275 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-08 05:12:08,275 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-08 05:12:08,625 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:08,625 INFO L294 olderBase$Statistics]: this new event has 724 ancestors and is cut-off event [2025-02-08 05:12:08,625 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:12:08,625 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-08 05:12:08,625 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-08 05:12:08,789 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:08,789 INFO L294 olderBase$Statistics]: this new event has 725 ancestors and is cut-off event [2025-02-08 05:12:08,789 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-08 05:12:08,789 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-08 05:12:08,789 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:12:09,765 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:09,766 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-02-08 05:12:09,766 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:12:09,766 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:12:09,766 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-08 05:12:09,929 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:09,929 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-02-08 05:12:09,929 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:12:09,929 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:12:09,929 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-08 05:12:10,238 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:10,238 INFO L294 olderBase$Statistics]: this new event has 732 ancestors and is cut-off event [2025-02-08 05:12:10,238 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-08 05:12:10,238 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-08 05:12:10,238 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-08 05:12:10,392 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:10,393 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-02-08 05:12:10,393 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-08 05:12:10,393 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-08 05:12:10,393 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-08 05:12:11,335 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:11,335 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-02-08 05:12:11,335 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-08 05:12:11,335 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-08 05:12:11,335 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-08 05:12:11,561 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:11,561 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-02-08 05:12:11,562 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:12:11,562 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-02-08 05:12:11,562 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-08 05:12:11,789 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:11,789 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-02-08 05:12:11,789 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:12:11,789 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-02-08 05:12:11,789 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-08 05:12:12,014 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:12,015 INFO L294 olderBase$Statistics]: this new event has 740 ancestors and is cut-off event [2025-02-08 05:12:12,015 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-08 05:12:12,015 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-08 05:12:12,015 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-02-08 05:12:12,414 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:12,414 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,414 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:12,414 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,414 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:12,415 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:12,415 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,415 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:12,415 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:12,415 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,415 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:12,415 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,415 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:12,415 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:12,415 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,418 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:12,418 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,418 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:12,418 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:12,418 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-08 05:12:12,556 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:12,556 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-08 05:12:12,556 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-08 05:12:12,556 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:12,556 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:12,558 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:12,558 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-08 05:12:12,558 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-08 05:12:12,558 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:12,558 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-08 05:12:12,699 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:12,699 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-08 05:12:12,699 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:12:12,699 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:12,699 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:12,701 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:12,701 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-08 05:12:12,701 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:12,701 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-08 05:12:12,701 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-08 05:12:12,848 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:12,849 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-02-08 05:12:12,849 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-02-08 05:12:12,849 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-02-08 05:12:12,849 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-02-08 05:12:13,002 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:13,002 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-08 05:12:13,002 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:12:13,002 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:13,003 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:13,003 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:13,003 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-08 05:12:13,003 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:12:13,003 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:13,003 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:13,004 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:13,004 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-08 05:12:13,004 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-08 05:12:13,004 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:13,004 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-08 05:12:13,363 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:13,363 INFO L294 olderBase$Statistics]: this new event has 746 ancestors and is cut-off event [2025-02-08 05:12:13,363 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:12:13,363 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-08 05:12:13,363 INFO L297 olderBase$Statistics]: existing Event has 746 ancestors and is cut-off event [2025-02-08 05:12:13,502 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:13,502 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-02-08 05:12:13,502 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:12:13,502 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-08 05:12:13,502 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-02-08 05:12:14,606 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:14,607 INFO L294 olderBase$Statistics]: this new event has 755 ancestors and is cut-off event [2025-02-08 05:12:14,607 INFO L297 olderBase$Statistics]: existing Event has 755 ancestors and is cut-off event [2025-02-08 05:12:14,607 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:14,607 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-08 05:12:16,092 INFO L124 PetriNetUnfolderBase]: 13850/59070 cut-off events. [2025-02-08 05:12:16,092 INFO L125 PetriNetUnfolderBase]: For 1961/1966 co-relation queries the response was YES. [2025-02-08 05:12:16,558 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:16,886 INFO L140 encePairwiseOnDemand]: 905/932 looper letters, 72 selfloop transitions, 78 changer transitions 0/1012 dead transitions. [2025-02-08 05:12:16,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 1012 transitions, 2440 flow [2025-02-08 05:12:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:12:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:12:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5305 transitions. [2025-02-08 05:12:16,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486766809728183 [2025-02-08 05:12:16,901 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:16,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 1012 transitions, 2440 flow [2025-02-08 05:12:16,928 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:16,942 INFO L231 Difference]: Finished difference. Result has 905 places, 982 transitions, 2344 flow [2025-02-08 05:12:16,944 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:16,945 INFO L279 CegarLoopForPetriNet]: 933 programPoint places, -28 predicate places. [2025-02-08 05:12:16,946 INFO L471 AbstractCegarLoop]: Abstraction has has 905 places, 982 transitions, 2344 flow [2025-02-08 05:12:16,949 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:16,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:16,950 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:16,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:12:16,951 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:16,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1125653212, now seen corresponding path program 1 times [2025-02-08 05:12:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:16,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39247107] [2025-02-08 05:12:16,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:16,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:17,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-08 05:12:17,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-08 05:12:17,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:17,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:17,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:12:17,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-02-08 05:12:17,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-02-08 05:12:17,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:17,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:12:17,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:12:17,477 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:12:17,477 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 69 remaining) [2025-02-08 05:12:17,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-02-08 05:12:17,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-02-08 05:12:17,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-02-08 05:12:17,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-02-08 05:12:17,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-02-08 05:12:17,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (29 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (27 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-02-08 05:12:17,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-02-08 05:12:17,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-02-08 05:12:17,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-02-08 05:12:17,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-02-08 05:12:17,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-02-08 05:12:17,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-02-08 05:12:17,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-02-08 05:12:17,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-02-08 05:12:17,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-02-08 05:12:17,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-02-08 05:12:17,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-02-08 05:12:17,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-02-08 05:12:17,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-02-08 05:12:17,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-02-08 05:12:17,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-02-08 05:12:17,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-02-08 05:12:17,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-02-08 05:12:17,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-02-08 05:12:17,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-02-08 05:12:17,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-02-08 05:12:17,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-02-08 05:12:17,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-02-08 05:12:17,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-02-08 05:12:17,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-02-08 05:12:17,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-02-08 05:12:17,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-02-08 05:12:17,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:12:17,483 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:12:17,484 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:12:17,485 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:12:17,604 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:12:17,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1020 places, 1019 transitions, 2066 flow [2025-02-08 05:12:18,040 INFO L124 PetriNetUnfolderBase]: 8/1053 cut-off events. [2025-02-08 05:12:18,040 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:12:18,050 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:18,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 1020 places, 1019 transitions, 2066 flow [2025-02-08 05:12:18,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1020 places, 1019 transitions, 2066 flow [2025-02-08 05:12:18,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:12:18,061 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;@725eaae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:12:18,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 05:12:18,121 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:12:18,121 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-08 05:12:18,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:12:18,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:18,122 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:18,122 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:18,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash -447742077, now seen corresponding path program 1 times [2025-02-08 05:12:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:18,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623577645] [2025-02-08 05:12:18,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:18,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:18,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-08 05:12:18,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-08 05:12:18,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:18,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:19,497 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:19,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:19,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623577645] [2025-02-08 05:12:19,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623577645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:19,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:19,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:12:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890860065] [2025-02-08 05:12:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:12:19,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:19,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:12:19,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:12:19,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 950 out of 1019 [2025-02-08 05:12:19,504 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:19,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:19,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 950 of 1019 [2025-02-08 05:12:19,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:12:25,266 INFO L124 PetriNetUnfolderBase]: 3368/23452 cut-off events. [2025-02-08 05:12:25,267 INFO L125 PetriNetUnfolderBase]: For 1926/1926 co-relation queries the response was YES. [2025-02-08 05:12:25,462 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:25,636 INFO L140 encePairwiseOnDemand]: 974/1019 looper letters, 24 selfloop transitions, 0 changer transitions 0/967 dead transitions. [2025-02-08 05:12:25,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 967 transitions, 2010 flow [2025-02-08 05:12:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:12:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:12:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1969 transitions. [2025-02-08 05:12:25,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9661432777232581 [2025-02-08 05:12:25,642 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:25,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 969 places, 967 transitions, 2010 flow [2025-02-08 05:12:25,648 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:25,660 INFO L231 Difference]: Finished difference. Result has 969 places, 967 transitions, 1956 flow [2025-02-08 05:12:25,662 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:25,664 INFO L279 CegarLoopForPetriNet]: 1020 programPoint places, -51 predicate places. [2025-02-08 05:12:25,664 INFO L471 AbstractCegarLoop]: Abstraction has has 969 places, 967 transitions, 1956 flow [2025-02-08 05:12:25,665 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:25,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:12:25,666 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:25,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:12:25,666 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:25,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:12:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash -783246681, now seen corresponding path program 1 times [2025-02-08 05:12:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:12:25,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821955205] [2025-02-08 05:12:25,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:12:25,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:12:25,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-08 05:12:25,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-08 05:12:25,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:12:25,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:12:26,065 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:26,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:12:26,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821955205] [2025-02-08 05:12:26,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821955205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:12:26,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:12:26,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:12:26,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240423352] [2025-02-08 05:12:26,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:12:26,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:12:26,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:12:26,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:12:26,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:12:26,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 934 out of 1019 [2025-02-08 05:12:26,102 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:26,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:12:26,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 934 of 1019 [2025-02-08 05:12:26,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand