./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/25_stack.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/25_stack.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 9f07ddd0bf7ae4134116576ef500b9c6d91475d3c23175717b2cac1146eab3b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:10:59,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:10:59,879 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:10:59,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:10:59,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:10:59,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:10:59,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:10:59,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:10:59,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:10:59,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:10:59,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:10:59,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:10:59,910 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:10:59,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:10:59,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:10:59,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:10:59,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:10:59,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:10:59,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:10:59,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:10:59,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:10:59,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:10:59,913 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:10:59,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:10:59,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:10:59,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:10:59,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:10:59,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:10:59,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:10:59,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:10:59,913 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 -> 9f07ddd0bf7ae4134116576ef500b9c6d91475d3c23175717b2cac1146eab3b3 [2025-02-08 05:11:00,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:11:00,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:11:00,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:11:00,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:11:00,161 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:11:00,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/25_stack.i [2025-02-08 05:11:01,350 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/519be2af7/0ee791ba98f1422aa19fbe7affa44b30/FLAGdd7b31b76 [2025-02-08 05:11:01,632 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:11:01,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack.i [2025-02-08 05:11:01,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/519be2af7/0ee791ba98f1422aa19fbe7affa44b30/FLAGdd7b31b76 [2025-02-08 05:11:01,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/519be2af7/0ee791ba98f1422aa19fbe7affa44b30 [2025-02-08 05:11:01,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:11:01,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:11:01,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:01,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:11:01,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:11:01,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:01" (1/1) ... [2025-02-08 05:11:01,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c78adea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:01, skipping insertion in model container [2025-02-08 05:11:01,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:11:01" (1/1) ... [2025-02-08 05:11:01,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:11:01,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:01,994 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:11:02,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:11:02,053 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:11:02,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:02 WrapperNode [2025-02-08 05:11:02,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:11:02,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:02,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:11:02,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:11:02,060 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:02" (1/1) ... [2025-02-08 05:11:02,072 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:02" (1/1) ... [2025-02-08 05:11:02,093 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 230 [2025-02-08 05:11:02,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:11:02,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:11:02,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:11:02,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:11:02,101 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:02" (1/1) ... [2025-02-08 05:11:02,101 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:02" (1/1) ... [2025-02-08 05:11:02,105 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:02" (1/1) ... [2025-02-08 05:11:02,106 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:02" (1/1) ... [2025-02-08 05:11:02,114 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:02" (1/1) ... [2025-02-08 05:11:02,116 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:02" (1/1) ... [2025-02-08 05:11:02,120 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:02" (1/1) ... [2025-02-08 05:11:02,121 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:02" (1/1) ... [2025-02-08 05:11:02,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:11:02,127 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:11:02,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:11:02,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:11:02,128 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:02" (1/1) ... [2025-02-08 05:11:02,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:11:02,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:11:02,156 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:02,158 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:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:11:02,177 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:11:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:11:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:11:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:11:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:11:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:11:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:11:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:11:02,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:11:02,179 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:02,263 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:11:02,265 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:11:02,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721: havoc push_#t~ret8#1; [2025-02-08 05:11:02,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: [2025-02-08 05:11:02,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-2: SUMMARY for call push_#t~ret8#1 := #PthreadsMutexLock(~#m~0.base, ~#m~0.offset); srcloc: null [2025-02-08 05:11:02,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-3: [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: assume 0 == #race~top~0; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: assume !(0 == #race~top~0); [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-1: push_~oldTop~0#1 := ~top~0; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L722-2: #race~top~0 := 0; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: assume #race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet9#1; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: assume !(#race~memory~0[1 + push_~newTop~0#1] == push_#t~nondet9#1); [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-1: havoc push_#t~nondet9#1; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-2: #race~memory~0 := #race~memory~0[1 + push_~newTop~0#1 := push_#t~nondet9#1]; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-3: havoc push_#t~nondet9#1; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-4: ~memory~0 := ~memory~0[1 + push_~newTop~0#1 := push_~oldTop~0#1]; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: assume false; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: assume !false; [2025-02-08 05:11:02,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L13-1: assume false; [2025-02-08 05:11:02,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L724: ~top~0 := push_~newTop~0#1; [2025-02-08 05:11:02,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716: havoc push_#t~ret6#1; [2025-02-08 05:11:02,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-1: push_~newTop~0#1 := push_#t~ret6#1; [2025-02-08 05:11:02,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-2: assume { :end_inline_index_malloc } true;assume -2147483648 <= push_#t~ret6#1 && push_#t~ret6#1 <= 2147483647; [2025-02-08 05:11:02,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-3: havoc index_malloc_#t~ret1#1, index_malloc_#t~ret2#1, index_malloc_#t~nondet3#1, index_malloc_#t~ret4#1, index_malloc_~curr_alloc_idx~0#1; [2025-02-08 05:11:02,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L716-4: push_#t~ret6#1 := index_malloc_#res#1; [2025-02-08 05:11:02,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: assume #race~top~0 == push_#t~nondet10#1; [2025-02-08 05:11:02,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: assume !(#race~top~0 == push_#t~nondet10#1); [2025-02-08 05:11:02,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-1: havoc push_#t~nondet10#1; [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-2: #race~top~0 := push_#t~nondet10#1; [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L725-3: havoc push_#t~nondet10#1; [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume 0 == push_~newTop~0#1; [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume !(0 == push_~newTop~0#1); [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: havoc push_loop_#t~ret15#1; [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: assume 0 == ~top~0; [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: assume !(0 == ~top~0); [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-1: push_loop_~r~0#1 := push_loop_#t~ret15#1; [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: assume 0 == #race~top~0; [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: assume !(0 == #race~top~0); [2025-02-08 05:11:02,477 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume { :end_inline_push } true;assume -2147483648 <= push_loop_#t~ret15#1 && push_loop_#t~ret15#1 <= 2147483647; [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-2: #race~top~0 := 0; [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-3: havoc push_#in~d#1; [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: havoc push_#t~ret6#1, push_#t~nondet7#1, push_#t~ret8#1, push_#t~nondet9#1, push_#t~nondet10#1, push_#t~ret11#1, push_~d#1, push_~oldTop~0#1, push_~newTop~0#1; [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-5: push_loop_#t~ret15#1 := push_#res#1; [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: __VERIFIER_atomic_assert_~r#1 := __VERIFIER_atomic_assert_#in~r#1; [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L726: [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L718-1: push_#res#1 := 0; [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-1: havoc __VERIFIER_atomic_assert_#in~r#1;assume { :end_inline___VERIFIER_atomic_assert } true; [2025-02-08 05:11:02,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-2: havoc __VERIFIER_atomic_assert_#t~ret12#1, __VERIFIER_atomic_assert_#t~short13#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: isEmpty_#res#1 := 1; [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-3: havoc __VERIFIER_atomic_assert_#t~ret12#1, __VERIFIER_atomic_assert_#t~short13#1, __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L743-4: assume { :begin_inline___VERIFIER_atomic_assert } true;__VERIFIER_atomic_assert_#in~r#1 := push_loop_~r~0#1; [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: havoc push_#t~ret11#1; [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-1: [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-2: SUMMARY for call push_#t~ret11#1 := #PthreadsMutexUnlock(~#m~0.base, ~#m~0.offset); srcloc: null [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727-3: [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:11:02,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-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:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-3: havoc __VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-4: havoc __VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-5: assume !__VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-5: assume !!__VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-6: havoc __VERIFIER_atomic_assert_#t~ret12#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-7: havoc __VERIFIER_atomic_assert_#t~ret12#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-8: __VERIFIER_atomic_assert_#t~short13#1 := 0 == __VERIFIER_atomic_assert_#t~ret12#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-9: assume { :end_inline_isEmpty } true;assume -2147483648 <= __VERIFIER_atomic_assert_#t~ret12#1 && __VERIFIER_atomic_assert_#t~ret12#1 <= 2147483647; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728-1: push_#res#1 := 1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-10: __VERIFIER_atomic_assert_#t~ret12#1 := isEmpty_#res#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-11: assume __VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-11: assume !__VERIFIER_atomic_assert_#t~short13#1; [2025-02-08 05:11:02,480 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-12: assume { :begin_inline_isEmpty } true;havoc isEmpty_#res#1; [2025-02-08 05:11:02,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-13: __VERIFIER_atomic_assert_#t~short13#1 := 0 == __VERIFIER_atomic_assert_~r#1; [2025-02-08 05:11:02,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume #race~memory~0[push_~newTop~0#1] == push_#t~nondet7#1; [2025-02-08 05:11:02,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: assume !(#race~memory~0[push_~newTop~0#1] == push_#t~nondet7#1); [2025-02-08 05:11:02,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: havoc push_#t~nondet7#1; [2025-02-08 05:11:02,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-2: #race~memory~0 := #race~memory~0[push_~newTop~0#1 := push_#t~nondet7#1]; [2025-02-08 05:11:02,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-3: havoc push_#t~nondet7#1; [2025-02-08 05:11:02,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-4: ~memory~0 := ~memory~0[push_~newTop~0#1 := push_~d#1]; [2025-02-08 05:11:02,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: isEmpty_#res#1 := 0; [2025-02-08 05:11:02,580 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:11:02,581 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:11:02,606 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:11:02,607 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:11:02,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:02 BoogieIcfgContainer [2025-02-08 05:11:02,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:11:02,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:11:02,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:11:02,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:11:02,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:11:01" (1/3) ... [2025-02-08 05:11:02,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa24e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:02, skipping insertion in model container [2025-02-08 05:11:02,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:11:02" (2/3) ... [2025-02-08 05:11:02,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa24e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:11:02, skipping insertion in model container [2025-02-08 05:11:02,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:11:02" (3/3) ... [2025-02-08 05:11:02,616 INFO L128 eAbstractionObserver]: Analyzing ICFG 25_stack.i [2025-02-08 05:11:02,626 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:11:02,627 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 25_stack.i that has 2 procedures, 177 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-02-08 05:11:02,627 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:11:02,687 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:02,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 179 transitions, 362 flow [2025-02-08 05:11:02,783 INFO L124 PetriNetUnfolderBase]: 2/186 cut-off events. [2025-02-08 05:11:02,785 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:02,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 139 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2025-02-08 05:11:02,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 179 transitions, 362 flow [2025-02-08 05:11:02,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 179 transitions, 362 flow [2025-02-08 05:11:02,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:02,810 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;@32b5103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:02,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-02-08 05:11:02,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:02,834 INFO L124 PetriNetUnfolderBase]: 0/112 cut-off events. [2025-02-08 05:11:02,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:02,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:02,841 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] [2025-02-08 05:11:02,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:11:02,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1962550414, now seen corresponding path program 1 times [2025-02-08 05:11:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:02,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10230809] [2025-02-08 05:11:02,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:02,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:11:03,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:11:03,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:03,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:03,175 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:03,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:03,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10230809] [2025-02-08 05:11:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10230809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:03,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:03,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:03,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723639110] [2025-02-08 05:11:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:03,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:03,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:03,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:03,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:03,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 179 [2025-02-08 05:11:03,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 179 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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:03,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:03,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 179 [2025-02-08 05:11:03,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:03,297 INFO L124 PetriNetUnfolderBase]: 2/228 cut-off events. [2025-02-08 05:11:03,297 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:03,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 228 events. 2/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 230 event pairs, 0 based on Foata normal form. 15/228 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. [2025-02-08 05:11:03,299 INFO L140 encePairwiseOnDemand]: 174/179 looper letters, 11 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2025-02-08 05:11:03,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 176 transitions, 382 flow [2025-02-08 05:11:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-02-08 05:11:03,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664804469273743 [2025-02-08 05:11:03,310 INFO L175 Difference]: Start difference. First operand has 180 places, 179 transitions, 362 flow. Second operand 3 states and 519 transitions. [2025-02-08 05:11:03,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 176 transitions, 382 flow [2025-02-08 05:11:03,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 176 transitions, 382 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:03,318 INFO L231 Difference]: Finished difference. Result has 175 places, 172 transitions, 352 flow [2025-02-08 05:11:03,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=175, PETRI_TRANSITIONS=172} [2025-02-08 05:11:03,324 INFO L279 CegarLoopForPetriNet]: 180 programPoint places, -5 predicate places. [2025-02-08 05:11:03,324 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 172 transitions, 352 flow [2025-02-08 05:11:03,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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:03,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:03,325 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] [2025-02-08 05:11:03,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:11:03,325 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:11:03,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1047940841, now seen corresponding path program 1 times [2025-02-08 05:11:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549318819] [2025-02-08 05:11:03,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:03,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:11:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:11:03,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:03,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:03,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 05:11:03,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 05:11:03,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:03,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:03,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:03,450 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:03,451 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-02-08 05:11:03,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-02-08 05:11:03,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-02-08 05:11:03,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-02-08 05:11:03,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-02-08 05:11:03,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-02-08 05:11:03,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-02-08 05:11:03,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-02-08 05:11:03,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-02-08 05:11:03,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-02-08 05:11:03,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-02-08 05:11:03,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-02-08 05:11:03,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-02-08 05:11:03,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-02-08 05:11:03,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-02-08 05:11:03,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:11:03,455 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:11:03,457 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:03,457 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:11:03,500 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:03,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 257 transitions, 524 flow [2025-02-08 05:11:03,542 INFO L124 PetriNetUnfolderBase]: 4/273 cut-off events. [2025-02-08 05:11:03,543 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:11:03,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 273 events. 4/273 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 535 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 187. Up to 3 conditions per place. [2025-02-08 05:11:03,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 257 transitions, 524 flow [2025-02-08 05:11:03,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 257 transitions, 524 flow [2025-02-08 05:11:03,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:03,547 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;@32b5103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:03,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 05:11:03,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:03,556 INFO L124 PetriNetUnfolderBase]: 0/112 cut-off events. [2025-02-08 05:11:03,556 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:03,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:03,558 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] [2025-02-08 05:11:03,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:11:03,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash -630669678, now seen corresponding path program 1 times [2025-02-08 05:11:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753128118] [2025-02-08 05:11:03,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:03,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:11:03,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:11:03,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:03,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:11:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:03,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753128118] [2025-02-08 05:11:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753128118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:03,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900787604] [2025-02-08 05:11:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:03,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:03,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:03,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:03,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 257 [2025-02-08 05:11:03,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 257 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:03,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:03,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 257 [2025-02-08 05:11:03,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:03,965 INFO L124 PetriNetUnfolderBase]: 179/1941 cut-off events. [2025-02-08 05:11:03,965 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-08 05:11:03,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2304 conditions, 1941 events. 179/1941 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 15087 event pairs, 59 based on Foata normal form. 198/1903 useless extension candidates. Maximal degree in co-relation 1616. Up to 162 conditions per place. [2025-02-08 05:11:03,984 INFO L140 encePairwiseOnDemand]: 246/257 looper letters, 31 selfloop transitions, 6 changer transitions 0/266 dead transitions. [2025-02-08 05:11:03,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 266 transitions, 621 flow [2025-02-08 05:11:03,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-02-08 05:11:03,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688715953307393 [2025-02-08 05:11:03,988 INFO L175 Difference]: Start difference. First operand has 258 places, 257 transitions, 524 flow. Second operand 3 states and 747 transitions. [2025-02-08 05:11:03,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 266 transitions, 621 flow [2025-02-08 05:11:03,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 266 transitions, 621 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:03,995 INFO L231 Difference]: Finished difference. Result has 254 places, 255 transitions, 560 flow [2025-02-08 05:11:03,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=254, PETRI_TRANSITIONS=255} [2025-02-08 05:11:03,996 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -4 predicate places. [2025-02-08 05:11:03,996 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 255 transitions, 560 flow [2025-02-08 05:11:03,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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:03,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:03,997 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] [2025-02-08 05:11:03,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:11:03,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:11:03,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1535544223, now seen corresponding path program 1 times [2025-02-08 05:11:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924536559] [2025-02-08 05:11:03,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:04,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:04,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:11:04,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:11:04,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:04,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:04,041 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:04,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:11:04,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:11:04,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:04,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:04,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:04,082 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-08 05:11:04,082 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-08 05:11:04,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-08 05:11:04,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-08 05:11:04,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-08 05:11:04,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-08 05:11:04,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-08 05:11:04,083 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-08 05:11:04,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:11:04,083 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 05:11:04,083 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:04,083 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:11:04,126 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:04,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 335 transitions, 688 flow [2025-02-08 05:11:04,176 INFO L124 PetriNetUnfolderBase]: 6/360 cut-off events. [2025-02-08 05:11:04,176 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:11:04,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 360 events. 6/360 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1021 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 277. Up to 4 conditions per place. [2025-02-08 05:11:04,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 336 places, 335 transitions, 688 flow [2025-02-08 05:11:04,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 335 transitions, 688 flow [2025-02-08 05:11:04,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:04,184 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;@32b5103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:04,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-08 05:11:04,192 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:04,192 INFO L124 PetriNetUnfolderBase]: 0/110 cut-off events. [2025-02-08 05:11:04,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:11:04,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:04,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:11:04,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:11:04,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1075928101, now seen corresponding path program 1 times [2025-02-08 05:11:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:04,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-02-08 05:11:04,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:04,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:04,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:11:04,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:11:04,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:04,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:04,278 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:04,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-02-08 05:11:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569548551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919457811] [2025-02-08 05:11:04,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:04,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:04,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:04,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:04,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 335 [2025-02-08 05:11:04,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 335 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:04,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:04,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 335 [2025-02-08 05:11:04,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:06,751 INFO L124 PetriNetUnfolderBase]: 3786/22260 cut-off events. [2025-02-08 05:11:06,752 INFO L125 PetriNetUnfolderBase]: For 949/949 co-relation queries the response was YES. [2025-02-08 05:11:06,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28311 conditions, 22260 events. 3786/22260 cut-off events. For 949/949 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 295730 event pairs, 1321 based on Foata normal form. 2411/21704 useless extension candidates. Maximal degree in co-relation 25126. Up to 2781 conditions per place. [2025-02-08 05:11:06,991 INFO L140 encePairwiseOnDemand]: 319/335 looper letters, 47 selfloop transitions, 9 changer transitions 0/351 dead transitions. [2025-02-08 05:11:06,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 351 transitions, 844 flow [2025-02-08 05:11:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-02-08 05:11:06,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9651741293532339 [2025-02-08 05:11:06,995 INFO L175 Difference]: Start difference. First operand has 336 places, 335 transitions, 688 flow. Second operand 3 states and 970 transitions. [2025-02-08 05:11:06,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 351 transitions, 844 flow [2025-02-08 05:11:07,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 351 transitions, 840 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:07,003 INFO L231 Difference]: Finished difference. Result has 330 places, 334 transitions, 744 flow [2025-02-08 05:11:07,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=330, PETRI_TRANSITIONS=334} [2025-02-08 05:11:07,006 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, -6 predicate places. [2025-02-08 05:11:07,006 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 334 transitions, 744 flow [2025-02-08 05:11:07,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:07,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:07,007 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] [2025-02-08 05:11:07,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:11:07,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:11:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1820814996, now seen corresponding path program 1 times [2025-02-08 05:11:07,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:07,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161290009] [2025-02-08 05:11:07,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:07,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:07,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:11:07,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:11:07,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:07,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:07,159 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:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161290009] [2025-02-08 05:11:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161290009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:07,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:07,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121018918] [2025-02-08 05:11:07,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:07,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:07,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:07,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:07,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 335 [2025-02-08 05:11:07,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 334 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 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:07,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:07,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 335 [2025-02-08 05:11:07,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:08,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread2of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|, thr1Thread2of3ForFork0_#t~ret19#1=|v_thr1Thread2of3ForFork0_#t~ret19#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_#t~ret19#1][151], [310#L758-1true, 337#true, 74#L766-2true, Black: 339#true, 335#true, 169#L755-2true, 344#true, 48#L758-1true, 341#(= |#race~state~0| 0), 333#true]) [2025-02-08 05:11:08,218 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:11:08,218 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-02-08 05:11:08,218 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:08,218 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-02-08 05:11:08,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [310#L758-1true, 337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 344#true, 333#true, 232#L706-4true]) [2025-02-08 05:11:08,295 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2025-02-08 05:11:08,295 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:11:08,295 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-02-08 05:11:08,295 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-02-08 05:11:08,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [310#L758-1true, 337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 22#L706-2true, 339#true, 344#true, 333#true]) [2025-02-08 05:11:08,370 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2025-02-08 05:11:08,370 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2025-02-08 05:11:08,370 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-08 05:11:08,370 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-02-08 05:11:08,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][229], [326#L706true, 310#L758-1true, 337#true, 183#L758-1true, 346#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 333#true]) [2025-02-08 05:11:08,412 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2025-02-08 05:11:08,412 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:11:08,412 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2025-02-08 05:11:08,412 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-02-08 05:11:08,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][229], [310#L758-1true, 337#true, 183#L758-1true, 346#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 74#L766-2true, Black: 341#(= |#race~state~0| 0), 3#L706-1true, 335#true, 339#true, 333#true]) [2025-02-08 05:11:08,450 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2025-02-08 05:11:08,450 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:11:08,450 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2025-02-08 05:11:08,450 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-02-08 05:11:08,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [310#L758-1true, 337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 344#true, 68#L754-1true, 333#true]) [2025-02-08 05:11:08,492 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2025-02-08 05:11:08,492 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:08,492 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-02-08 05:11:08,492 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2025-02-08 05:11:08,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [183#L758-1true, 310#L758-1true, 337#true, 201#L754true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 344#true, 333#true]) [2025-02-08 05:11:08,601 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2025-02-08 05:11:08,601 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-02-08 05:11:08,601 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2025-02-08 05:11:08,601 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2025-02-08 05:11:09,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread2of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|, thr1Thread2of3ForFork0_#t~ret19#1=|v_thr1Thread2of3ForFork0_#t~ret19#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_#t~ret19#1][151], [337#true, 310#L758-1true, 74#L766-2true, 59#L694true, Black: 339#true, 335#true, 169#L755-2true, 344#true, 341#(= |#race~state~0| 0), 333#true]) [2025-02-08 05:11:09,139 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2025-02-08 05:11:09,139 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-02-08 05:11:09,139 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2025-02-08 05:11:09,139 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2025-02-08 05:11:09,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 344#true, 216#L694true, 333#true, 232#L706-4true]) [2025-02-08 05:11:09,244 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2025-02-08 05:11:09,244 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-02-08 05:11:09,244 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-02-08 05:11:09,245 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-02-08 05:11:09,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 22#L706-2true, 339#true, 344#true, 216#L694true, 333#true]) [2025-02-08 05:11:09,345 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2025-02-08 05:11:09,345 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-08 05:11:09,345 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-02-08 05:11:09,345 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2025-02-08 05:11:09,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][229], [326#L706true, 183#L758-1true, 337#true, 346#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 216#L694true, 333#true]) [2025-02-08 05:11:09,396 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-02-08 05:11:09,396 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:09,397 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-02-08 05:11:09,397 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:09,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread2of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|, thr1Thread2of3ForFork0_#t~ret19#1=|v_thr1Thread2of3ForFork0_#t~ret19#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_#t~ret19#1][151], [337#true, 113#L696true, 310#L758-1true, 74#L766-2true, Black: 339#true, 335#true, 169#L755-2true, 344#true, 341#(= |#race~state~0| 0), 333#true]) [2025-02-08 05:11:09,418 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2025-02-08 05:11:09,418 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:09,418 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-02-08 05:11:09,418 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2025-02-08 05:11:09,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][229], [183#L758-1true, 337#true, 346#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 74#L766-2true, Black: 341#(= |#race~state~0| 0), 3#L706-1true, 335#true, 339#true, 216#L694true, 333#true]) [2025-02-08 05:11:09,447 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-02-08 05:11:09,447 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-02-08 05:11:09,447 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-02-08 05:11:09,447 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-02-08 05:11:09,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [183#L758-1true, 337#true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 344#true, 68#L754-1true, 216#L694true, 333#true]) [2025-02-08 05:11:09,498 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-02-08 05:11:09,498 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-02-08 05:11:09,498 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-02-08 05:11:09,499 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-02-08 05:11:09,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 70#L696true, 335#true, 339#true, 344#true, 333#true, 232#L706-4true]) [2025-02-08 05:11:09,514 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-02-08 05:11:09,514 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-02-08 05:11:09,514 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-02-08 05:11:09,514 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-02-08 05:11:09,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [183#L758-1true, 201#L754true, 337#true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 344#true, 216#L694true, 333#true]) [2025-02-08 05:11:09,552 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-02-08 05:11:09,552 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-08 05:11:09,552 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-08 05:11:09,552 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-02-08 05:11:09,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 70#L696true, 335#true, 22#L706-2true, 339#true, 344#true, 333#true]) [2025-02-08 05:11:09,601 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-02-08 05:11:09,601 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-08 05:11:09,601 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-02-08 05:11:09,601 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-02-08 05:11:09,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][229], [326#L706true, 183#L758-1true, 337#true, 346#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 74#L766-2true, Black: 341#(= |#race~state~0| 0), 70#L696true, 335#true, 339#true, 333#true]) [2025-02-08 05:11:09,643 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-02-08 05:11:09,643 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-02-08 05:11:09,643 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-02-08 05:11:09,643 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-02-08 05:11:09,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][229], [183#L758-1true, 337#true, 346#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 74#L766-2true, Black: 341#(= |#race~state~0| 0), 70#L696true, 3#L706-1true, 335#true, 339#true, 333#true]) [2025-02-08 05:11:09,677 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-02-08 05:11:09,677 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-02-08 05:11:09,677 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-02-08 05:11:09,677 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-08 05:11:09,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 70#L696true, 335#true, 339#true, 344#true, 68#L754-1true, 333#true]) [2025-02-08 05:11:09,714 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-02-08 05:11:09,714 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-02-08 05:11:09,714 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-08 05:11:09,714 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-02-08 05:11:09,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [337#true, 183#L758-1true, 201#L754true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 70#L696true, 335#true, 339#true, 344#true, 333#true]) [2025-02-08 05:11:09,753 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2025-02-08 05:11:09,753 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-02-08 05:11:09,753 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-02-08 05:11:09,753 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-02-08 05:11:09,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread2of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|, thr1Thread2of3ForFork0_#t~ret19#1=|v_thr1Thread2of3ForFork0_#t~ret19#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of3ForFork0_#t~ret19#1][151], [337#true, 310#L758-1true, 289#L701true, 74#L766-2true, Black: 339#true, 335#true, 169#L755-2true, 344#true, 341#(= |#race~state~0| 0), 333#true]) [2025-02-08 05:11:09,834 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-02-08 05:11:09,834 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-02-08 05:11:09,834 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-02-08 05:11:09,834 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-02-08 05:11:09,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 344#true, 125#L701true, 333#true, 232#L706-4true]) [2025-02-08 05:11:09,891 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-02-08 05:11:09,891 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-02-08 05:11:09,891 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-02-08 05:11:09,891 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-02-08 05:11:09,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [183#L758-1true, 337#true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 22#L706-2true, 339#true, 344#true, 125#L701true, 333#true]) [2025-02-08 05:11:09,949 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-02-08 05:11:09,949 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-08 05:11:09,949 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-02-08 05:11:09,949 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-02-08 05:11:09,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][229], [326#L706true, 337#true, 183#L758-1true, 346#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 125#L701true, 333#true]) [2025-02-08 05:11:09,976 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-02-08 05:11:09,976 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-02-08 05:11:09,976 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-08 05:11:09,976 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-02-08 05:11:10,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][229], [337#true, 183#L758-1true, 346#(= |#race~top~0| |thr1Thread1of3ForFork0_EBStack_init_#t~nondet5#1|), 74#L766-2true, Black: 341#(= |#race~state~0| 0), 3#L706-1true, 335#true, 339#true, 125#L701true, 333#true]) [2025-02-08 05:11:10,000 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-02-08 05:11:10,000 INFO L297 olderBase$Statistics]: existing Event has 192 ancestors and is cut-off event [2025-02-08 05:11:10,000 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-02-08 05:11:10,000 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-02-08 05:11:10,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [337#true, 183#L758-1true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 344#true, 339#true, 68#L754-1true, 125#L701true, 333#true]) [2025-02-08 05:11:10,028 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-02-08 05:11:10,028 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-08 05:11:10,028 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-02-08 05:11:10,029 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-02-08 05:11:10,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1067] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread3of3ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, ~#m2~0.base=|v_~#m2~0.base_11|, thr1Thread3of3ForFork0_#t~ret19#1=|v_thr1Thread3of3ForFork0_#t~ret19#1_1|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread3of3ForFork0_#t~ret19#1][196], [201#L754true, 183#L758-1true, 337#true, 74#L766-2true, Black: 341#(= |#race~state~0| 0), 335#true, 339#true, 344#true, 125#L701true, 333#true]) [2025-02-08 05:11:10,055 INFO L294 olderBase$Statistics]: this new event has 194 ancestors and is cut-off event [2025-02-08 05:11:10,055 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-08 05:11:10,055 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-02-08 05:11:10,055 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-02-08 05:11:10,429 INFO L124 PetriNetUnfolderBase]: 5390/31189 cut-off events. [2025-02-08 05:11:10,429 INFO L125 PetriNetUnfolderBase]: For 1023/1028 co-relation queries the response was YES. [2025-02-08 05:11:10,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40559 conditions, 31189 events. 5390/31189 cut-off events. For 1023/1028 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 446073 event pairs, 2966 based on Foata normal form. 0/26967 useless extension candidates. Maximal degree in co-relation 40223. Up to 6307 conditions per place. [2025-02-08 05:11:10,720 INFO L140 encePairwiseOnDemand]: 329/335 looper letters, 38 selfloop transitions, 5 changer transitions 0/350 dead transitions. [2025-02-08 05:11:10,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 350 transitions, 872 flow [2025-02-08 05:11:10,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2025-02-08 05:11:10,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512437810945273 [2025-02-08 05:11:10,722 INFO L175 Difference]: Start difference. First operand has 330 places, 334 transitions, 744 flow. Second operand 3 states and 956 transitions. [2025-02-08 05:11:10,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 350 transitions, 872 flow [2025-02-08 05:11:10,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 350 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:11:10,735 INFO L231 Difference]: Finished difference. Result has 332 places, 338 transitions, 764 flow [2025-02-08 05:11:10,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=332, PETRI_TRANSITIONS=338} [2025-02-08 05:11:10,737 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, -4 predicate places. [2025-02-08 05:11:10,737 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 338 transitions, 764 flow [2025-02-08 05:11:10,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 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:10,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:10,738 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] [2025-02-08 05:11:10,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:11:10,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:11:10,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:10,739 INFO L85 PathProgramCache]: Analyzing trace with hash 645065918, now seen corresponding path program 1 times [2025-02-08 05:11:10,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:10,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300347062] [2025-02-08 05:11:10,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:10,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:10,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:11:10,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:11:10,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:10,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:10,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:11:10,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-08 05:11:10,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-08 05:11:10,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:10,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:11:10,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:11:10,798 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:11:10,798 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-02-08 05:11:10,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-02-08 05:11:10,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-02-08 05:11:10,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-02-08 05:11:10,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:11:10,800 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:11:10,801 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:11:10,801 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:11:10,838 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:11:10,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 414 places, 413 transitions, 854 flow [2025-02-08 05:11:10,876 INFO L124 PetriNetUnfolderBase]: 8/447 cut-off events. [2025-02-08 05:11:10,876 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:11:10,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 447 events. 8/447 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1553 event pairs, 0 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 368. Up to 5 conditions per place. [2025-02-08 05:11:10,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 414 places, 413 transitions, 854 flow [2025-02-08 05:11:10,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 414 places, 413 transitions, 854 flow [2025-02-08 05:11:10,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:11:10,886 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;@32b5103, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:11:10,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-02-08 05:11:10,890 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:11:10,890 INFO L124 PetriNetUnfolderBase]: 0/112 cut-off events. [2025-02-08 05:11:10,890 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:11:10,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:10,891 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] [2025-02-08 05:11:10,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:11:10,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash -990761403, now seen corresponding path program 1 times [2025-02-08 05:11:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:10,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973810644] [2025-02-08 05:11:10,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:10,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:11:10,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:11:10,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:10,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:10,944 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:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:10,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973810644] [2025-02-08 05:11:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973810644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:10,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:10,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:10,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671626688] [2025-02-08 05:11:10,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:10,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:10,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:10,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:10,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:10,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 413 [2025-02-08 05:11:10,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 413 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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:10,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:10,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 413 [2025-02-08 05:11:10,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:38,692 INFO L124 PetriNetUnfolderBase]: 59889/252425 cut-off events. [2025-02-08 05:11:38,693 INFO L125 PetriNetUnfolderBase]: For 18122/18122 co-relation queries the response was YES. [2025-02-08 05:11:41,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339299 conditions, 252425 events. 59889/252425 cut-off events. For 18122/18122 co-relation queries the response was YES. Maximal size of possible extension queue 5699. Compared 4435366 event pairs, 21830 based on Foata normal form. 27688/245922 useless extension candidates. Maximal degree in co-relation 298971. Up to 40347 conditions per place. [2025-02-08 05:11:42,862 INFO L140 encePairwiseOnDemand]: 392/413 looper letters, 63 selfloop transitions, 12 changer transitions 0/436 dead transitions. [2025-02-08 05:11:42,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 436 transitions, 1071 flow [2025-02-08 05:11:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:11:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:11:42,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1193 transitions. [2025-02-08 05:11:42,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628732849071832 [2025-02-08 05:11:42,865 INFO L175 Difference]: Start difference. First operand has 414 places, 413 transitions, 854 flow. Second operand 3 states and 1193 transitions. [2025-02-08 05:11:42,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 436 transitions, 1071 flow [2025-02-08 05:11:42,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 436 transitions, 1059 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-02-08 05:11:42,878 INFO L231 Difference]: Finished difference. Result has 406 places, 413 transitions, 928 flow [2025-02-08 05:11:42,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=406, PETRI_TRANSITIONS=413} [2025-02-08 05:11:42,879 INFO L279 CegarLoopForPetriNet]: 414 programPoint places, -8 predicate places. [2025-02-08 05:11:42,879 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 413 transitions, 928 flow [2025-02-08 05:11:42,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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:42,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:11:42,880 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] [2025-02-08 05:11:42,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:11:42,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-02-08 05:11:42,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:11:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash 828320414, now seen corresponding path program 1 times [2025-02-08 05:11:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:11:42,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434701745] [2025-02-08 05:11:42,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:11:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:11:42,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 05:11:42,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 05:11:42,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:11:42,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:11:42,955 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:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:11:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434701745] [2025-02-08 05:11:42,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434701745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:11:42,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:11:42,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:11:42,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552176574] [2025-02-08 05:11:42,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:11:42,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:11:42,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:11:42,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:11:42,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:11:42,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 413 [2025-02-08 05:11:42,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 413 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 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:42,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:11:42,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 413 [2025-02-08 05:11:42,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:11:47,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1711] L757-4-->L758-1: Formula: (and (= |v_#pthreadsMutex_27| (store |v_#pthreadsMutex_28| |v_~#m2~0.base_11| (store (select |v_#pthreadsMutex_28| |v_~#m2~0.base_11|) |v_~#m2~0.offset_11| 0))) (= |v_thr1Thread2of4ForFork0_#t~ret19#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_28|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_27|, thr1Thread2of4ForFork0_#t~ret19#1=|v_thr1Thread2of4ForFork0_#t~ret19#1_1|, ~#m2~0.base=|v_~#m2~0.base_11|, ~#m2~0.offset=|v_~#m2~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, thr1Thread2of4ForFork0_#t~ret19#1][151], [51#L766-2true, Black: 417#true, 414#true, 411#true, 64#L755-2true, 413#true, 422#true, 419#(= |#race~state~0| 0), 228#L758-1true, 393#L758-1true, 409#true]) [2025-02-08 05:11:47,564 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2025-02-08 05:11:47,564 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-02-08 05:11:47,564 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2025-02-08 05:11:47,564 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event