./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:49:38,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:49:38,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:49:38,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:49:38,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:49:38,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:49:38,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:49:38,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:49:38,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:49:38,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:49:38,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:49:38,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:49:38,551 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:49:38,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:49:38,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:49:38,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:49:38,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:49:38,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:49:38,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:49:38,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:49:38,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:38,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:49:38,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:49:38,554 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:49:38,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:49:38,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:49:38,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:49:38,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:49:38,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:49:38,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:49:38,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:49:38,554 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/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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2025-03-04 06:49:38,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:49:38,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:49:38,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:49:38,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:49:38,780 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:49:38,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-03-04 06:49:39,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad09e6a8b/9282c76561604ae88a1a51ffc6a26ba6/FLAGa5999f1e1 [2025-03-04 06:49:40,194 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:49:40,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-03-04 06:49:40,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad09e6a8b/9282c76561604ae88a1a51ffc6a26ba6/FLAGa5999f1e1 [2025-03-04 06:49:40,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad09e6a8b/9282c76561604ae88a1a51ffc6a26ba6 [2025-03-04 06:49:40,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:49:40,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:49:40,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:40,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:49:40,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:49:40,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75254f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40, skipping insertion in model container [2025-03-04 06:49:40,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:49:40,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:40,483 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:49:40,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:49:40,554 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:49:40,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40 WrapperNode [2025-03-04 06:49:40,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:49:40,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:40,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:49:40,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:49:40,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,581 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 161 [2025-03-04 06:49:40,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:49:40,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:49:40,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:49:40,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:49:40,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,595 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:49:40,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:49:40,601 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:49:40,601 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:49:40,601 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (1/1) ... [2025-03-04 06:49:40,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:49:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:49:40,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:49:40,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:49:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:49:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:49:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:49:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:49:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:49:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:49:40,642 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:49:40,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:49:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:49:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:49:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:49:40,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:49:40,644 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:49:40,729 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:49:40,731 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:49:40,926 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:49:40,927 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L720-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:49:40,957 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:49:40,957 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:49:40,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:49:40,987 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:49:40,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:40 BoogieIcfgContainer [2025-03-04 06:49:40,987 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:49:40,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:49:40,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:49:40,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:49:40,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:49:40" (1/3) ... [2025-03-04 06:49:40,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259efe39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:40, skipping insertion in model container [2025-03-04 06:49:40,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:49:40" (2/3) ... [2025-03-04 06:49:40,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259efe39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:49:40, skipping insertion in model container [2025-03-04 06:49:40,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:49:40" (3/3) ... [2025-03-04 06:49:40,998 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2025-03-04 06:49:41,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:49:41,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_19-callback_racing.i that has 2 procedures, 164 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-03-04 06:49:41,012 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:49:41,068 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:49:41,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 177 transitions, 361 flow [2025-03-04 06:49:41,163 INFO L124 PetriNetUnfolderBase]: 21/283 cut-off events. [2025-03-04 06:49:41,164 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:49:41,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 283 events. 21/283 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 974 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 139. Up to 6 conditions per place. [2025-03-04 06:49:41,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 177 transitions, 361 flow [2025-03-04 06:49:41,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 177 transitions, 361 flow [2025-03-04 06:49:41,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:41,193 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;@608cdd79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:41,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 06:49:41,205 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:41,205 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-03-04 06:49:41,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:41,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:41,206 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] [2025-03-04 06:49:41,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:49:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1050876286, now seen corresponding path program 1 times [2025-03-04 06:49:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:41,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879516539] [2025-03-04 06:49:41,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:41,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:41,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:49:41,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:49:41,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:41,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:41,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:41,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879516539] [2025-03-04 06:49:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879516539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:41,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:41,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451705692] [2025-03-04 06:49:41,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:41,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:41,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:41,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:41,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:42,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 177 [2025-03-04 06:49:42,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 177 transitions, 361 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-03-04 06:49:42,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:42,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 177 [2025-03-04 06:49:42,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:42,232 INFO L124 PetriNetUnfolderBase]: 93/749 cut-off events. [2025-03-04 06:49:42,232 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:49:42,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 749 events. 93/749 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4124 event pairs, 33 based on Foata normal form. 77/770 useless extension candidates. Maximal degree in co-relation 793. Up to 154 conditions per place. [2025-03-04 06:49:42,236 INFO L140 encePairwiseOnDemand]: 161/177 looper letters, 40 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-03-04 06:49:42,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 180 transitions, 457 flow [2025-03-04 06:49:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 888 transitions. [2025-03-04 06:49:42,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8361581920903954 [2025-03-04 06:49:42,252 INFO L175 Difference]: Start difference. First operand has 167 places, 177 transitions, 361 flow. Second operand 6 states and 888 transitions. [2025-03-04 06:49:42,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 180 transitions, 457 flow [2025-03-04 06:49:42,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 180 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:42,258 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 345 flow [2025-03-04 06:49:42,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=169, PETRI_TRANSITIONS=164} [2025-03-04 06:49:42,263 INFO L279 CegarLoopForPetriNet]: 167 programPoint places, 2 predicate places. [2025-03-04 06:49:42,263 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 345 flow [2025-03-04 06:49:42,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-03-04 06:49:42,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:42,264 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] [2025-03-04 06:49:42,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:49:42,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:49:42,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1933640356, now seen corresponding path program 1 times [2025-03-04 06:49:42,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:42,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457713842] [2025-03-04 06:49:42,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:42,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:49:42,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:49:42,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:42,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:42,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:42,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457713842] [2025-03-04 06:49:42,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457713842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:42,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:42,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860110047] [2025-03-04 06:49:42,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:42,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:42,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:42,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:42,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 177 [2025-03-04 06:49:42,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 164 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-03-04 06:49:42,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:42,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 177 [2025-03-04 06:49:42,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:42,439 INFO L124 PetriNetUnfolderBase]: 113/920 cut-off events. [2025-03-04 06:49:42,439 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2025-03-04 06:49:42,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 920 events. 113/920 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4824 event pairs, 34 based on Foata normal form. 1/845 useless extension candidates. Maximal degree in co-relation 1024. Up to 137 conditions per place. [2025-03-04 06:49:42,445 INFO L140 encePairwiseOnDemand]: 168/177 looper letters, 30 selfloop transitions, 6 changer transitions 0/177 dead transitions. [2025-03-04 06:49:42,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 177 transitions, 446 flow [2025-03-04 06:49:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2025-03-04 06:49:42,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8813559322033898 [2025-03-04 06:49:42,448 INFO L175 Difference]: Start difference. First operand has 169 places, 164 transitions, 345 flow. Second operand 3 states and 468 transitions. [2025-03-04 06:49:42,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 177 transitions, 446 flow [2025-03-04 06:49:42,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 177 transitions, 436 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:49:42,452 INFO L231 Difference]: Finished difference. Result has 166 places, 166 transitions, 373 flow [2025-03-04 06:49:42,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=166, PETRI_TRANSITIONS=166} [2025-03-04 06:49:42,454 INFO L279 CegarLoopForPetriNet]: 167 programPoint places, -1 predicate places. [2025-03-04 06:49:42,454 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 166 transitions, 373 flow [2025-03-04 06:49:42,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-03-04 06:49:42,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:42,455 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] [2025-03-04 06:49:42,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:49:42,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:49:42,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:42,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2047309254, now seen corresponding path program 1 times [2025-03-04 06:49:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:42,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245977181] [2025-03-04 06:49:42,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:42,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:49:42,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:49:42,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:42,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:42,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:42,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245977181] [2025-03-04 06:49:42,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245977181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:42,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:42,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:49:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748492622] [2025-03-04 06:49:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:42,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:42,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:42,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:42,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 177 [2025-03-04 06:49:42,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 166 transitions, 373 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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-03-04 06:49:42,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:42,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 177 [2025-03-04 06:49:42,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:42,617 INFO L124 PetriNetUnfolderBase]: 86/1021 cut-off events. [2025-03-04 06:49:42,617 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-04 06:49:42,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 1021 events. 86/1021 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5560 event pairs, 10 based on Foata normal form. 1/951 useless extension candidates. Maximal degree in co-relation 1166. Up to 144 conditions per place. [2025-03-04 06:49:42,624 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 20 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-03-04 06:49:42,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 170 transitions, 425 flow [2025-03-04 06:49:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-03-04 06:49:42,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.879472693032015 [2025-03-04 06:49:42,638 INFO L175 Difference]: Start difference. First operand has 166 places, 166 transitions, 373 flow. Second operand 3 states and 467 transitions. [2025-03-04 06:49:42,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 170 transitions, 425 flow [2025-03-04 06:49:42,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 170 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:42,644 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 369 flow [2025-03-04 06:49:42,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2025-03-04 06:49:42,645 INFO L279 CegarLoopForPetriNet]: 167 programPoint places, 0 predicate places. [2025-03-04 06:49:42,645 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 369 flow [2025-03-04 06:49:42,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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-03-04 06:49:42,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:42,647 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 06:49:42,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:49:42,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:49:42,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash 852252081, now seen corresponding path program 1 times [2025-03-04 06:49:42,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:42,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074780402] [2025-03-04 06:49:42,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:42,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:42,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:49:42,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:49:42,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:42,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:42,675 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:49:42,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:49:42,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:49:42,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:42,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:42,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:49:42,716 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:49:42,718 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-04 06:49:42,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-04 06:49:42,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-04 06:49:42,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-04 06:49:42,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-04 06:49:42,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-04 06:49:42,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-04 06:49:42,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-04 06:49:42,720 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-04 06:49:42,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:49:42,721 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 06:49:42,724 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:49:42,724 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:49:42,750 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:49:42,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 209 transitions, 434 flow [2025-03-04 06:49:42,791 INFO L124 PetriNetUnfolderBase]: 35/448 cut-off events. [2025-03-04 06:49:42,791 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:49:42,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 448 events. 35/448 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1813 event pairs, 0 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 285. Up to 9 conditions per place. [2025-03-04 06:49:42,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 209 transitions, 434 flow [2025-03-04 06:49:42,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 209 transitions, 434 flow [2025-03-04 06:49:42,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:42,797 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;@608cdd79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:42,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 06:49:42,801 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:42,801 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-03-04 06:49:42,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:42,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:42,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:49:42,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:49:42,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:42,801 INFO L85 PathProgramCache]: Analyzing trace with hash -643387874, now seen corresponding path program 1 times [2025-03-04 06:49:42,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:42,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458999391] [2025-03-04 06:49:42,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:42,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:42,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:49:42,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:49:42,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:42,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:43,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:43,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458999391] [2025-03-04 06:49:43,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458999391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:43,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:43,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:43,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862120935] [2025-03-04 06:49:43,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:43,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:43,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:43,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:43,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:43,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 209 [2025-03-04 06:49:43,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 209 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 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-03-04 06:49:43,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:43,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 209 [2025-03-04 06:49:43,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:43,546 INFO L124 PetriNetUnfolderBase]: 1001/4569 cut-off events. [2025-03-04 06:49:43,546 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-04 06:49:43,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6228 conditions, 4569 events. 1001/4569 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 42489 event pairs, 262 based on Foata normal form. 765/5004 useless extension candidates. Maximal degree in co-relation 1825. Up to 1202 conditions per place. [2025-03-04 06:49:43,569 INFO L140 encePairwiseOnDemand]: 189/209 looper letters, 62 selfloop transitions, 5 changer transitions 0/222 dead transitions. [2025-03-04 06:49:43,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 222 transitions, 594 flow [2025-03-04 06:49:43,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1056 transitions. [2025-03-04 06:49:43,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2025-03-04 06:49:43,572 INFO L175 Difference]: Start difference. First operand has 196 places, 209 transitions, 434 flow. Second operand 6 states and 1056 transitions. [2025-03-04 06:49:43,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 222 transitions, 594 flow [2025-03-04 06:49:43,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 222 transitions, 594 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:43,575 INFO L231 Difference]: Finished difference. Result has 196 places, 190 transitions, 406 flow [2025-03-04 06:49:43,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=196, PETRI_TRANSITIONS=190} [2025-03-04 06:49:43,576 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 0 predicate places. [2025-03-04 06:49:43,576 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 190 transitions, 406 flow [2025-03-04 06:49:43,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 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-03-04 06:49:43,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:43,577 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] [2025-03-04 06:49:43,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:49:43,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:49:43,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 837644774, now seen corresponding path program 1 times [2025-03-04 06:49:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:43,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215405023] [2025-03-04 06:49:43,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:43,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:49:43,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:49:43,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:43,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:43,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:43,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215405023] [2025-03-04 06:49:43,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215405023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:43,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:43,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:43,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369251844] [2025-03-04 06:49:43,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:43,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:43,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:43,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:43,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:43,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 209 [2025-03-04 06:49:43,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 190 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-03-04 06:49:43,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:43,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 209 [2025-03-04 06:49:43,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:44,382 INFO L124 PetriNetUnfolderBase]: 2103/8663 cut-off events. [2025-03-04 06:49:44,382 INFO L125 PetriNetUnfolderBase]: For 224/351 co-relation queries the response was YES. [2025-03-04 06:49:44,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12187 conditions, 8663 events. 2103/8663 cut-off events. For 224/351 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 86119 event pairs, 747 based on Foata normal form. 8/7875 useless extension candidates. Maximal degree in co-relation 10950. Up to 2127 conditions per place. [2025-03-04 06:49:44,419 INFO L140 encePairwiseOnDemand]: 197/209 looper letters, 45 selfloop transitions, 8 changer transitions 0/211 dead transitions. [2025-03-04 06:49:44,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 211 transitions, 565 flow [2025-03-04 06:49:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2025-03-04 06:49:44,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.861244019138756 [2025-03-04 06:49:44,421 INFO L175 Difference]: Start difference. First operand has 196 places, 190 transitions, 406 flow. Second operand 3 states and 540 transitions. [2025-03-04 06:49:44,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 211 transitions, 565 flow [2025-03-04 06:49:44,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 211 transitions, 555 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:49:44,425 INFO L231 Difference]: Finished difference. Result has 193 places, 194 transitions, 452 flow [2025-03-04 06:49:44,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=193, PETRI_TRANSITIONS=194} [2025-03-04 06:49:44,425 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -3 predicate places. [2025-03-04 06:49:44,426 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 194 transitions, 452 flow [2025-03-04 06:49:44,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-03-04 06:49:44,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:44,426 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] [2025-03-04 06:49:44,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:49:44,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:49:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash 406959962, now seen corresponding path program 1 times [2025-03-04 06:49:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935852451] [2025-03-04 06:49:44,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:44,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:49:44,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:49:44,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:44,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935852451] [2025-03-04 06:49:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935852451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:44,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:44,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:49:44,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584762420] [2025-03-04 06:49:44,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:44,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:44,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:44,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:44,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 209 [2025-03-04 06:49:44,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 194 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-03-04 06:49:44,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:44,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 209 [2025-03-04 06:49:44,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:45,196 INFO L124 PetriNetUnfolderBase]: 1362/7508 cut-off events. [2025-03-04 06:49:45,196 INFO L125 PetriNetUnfolderBase]: For 394/475 co-relation queries the response was YES. [2025-03-04 06:49:45,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10322 conditions, 7508 events. 1362/7508 cut-off events. For 394/475 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 76513 event pairs, 874 based on Foata normal form. 1/6865 useless extension candidates. Maximal degree in co-relation 6766. Up to 1911 conditions per place. [2025-03-04 06:49:45,239 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 27 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2025-03-04 06:49:45,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 199 transitions, 520 flow [2025-03-04 06:49:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2025-03-04 06:49:45,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8564593301435407 [2025-03-04 06:49:45,242 INFO L175 Difference]: Start difference. First operand has 193 places, 194 transitions, 452 flow. Second operand 3 states and 537 transitions. [2025-03-04 06:49:45,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 199 transitions, 520 flow [2025-03-04 06:49:45,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 199 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:49:45,248 INFO L231 Difference]: Finished difference. Result has 194 places, 195 transitions, 448 flow [2025-03-04 06:49:45,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=194, PETRI_TRANSITIONS=195} [2025-03-04 06:49:45,249 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -2 predicate places. [2025-03-04 06:49:45,250 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 195 transitions, 448 flow [2025-03-04 06:49:45,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-03-04 06:49:45,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:45,250 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] [2025-03-04 06:49:45,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:49:45,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:49:45,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:45,251 INFO L85 PathProgramCache]: Analyzing trace with hash -133686887, now seen corresponding path program 1 times [2025-03-04 06:49:45,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:45,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543800852] [2025-03-04 06:49:45,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:45,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:45,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:49:45,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:49:45,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:45,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:49:45,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:45,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543800852] [2025-03-04 06:49:45,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543800852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:45,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:45,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:45,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676585530] [2025-03-04 06:49:45,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:45,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:49:45,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:45,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:49:45,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:49:45,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 209 [2025-03-04 06:49:45,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 195 transitions, 448 flow. Second operand has 5 states, 5 states have (on average 168.6) internal successors, (843), 5 states have internal predecessors, (843), 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-03-04 06:49:45,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:45,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 209 [2025-03-04 06:49:45,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:46,168 INFO L124 PetriNetUnfolderBase]: 1393/8519 cut-off events. [2025-03-04 06:49:46,169 INFO L125 PetriNetUnfolderBase]: For 167/179 co-relation queries the response was YES. [2025-03-04 06:49:46,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11079 conditions, 8519 events. 1393/8519 cut-off events. For 167/179 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 88967 event pairs, 415 based on Foata normal form. 5/7784 useless extension candidates. Maximal degree in co-relation 5106. Up to 1757 conditions per place. [2025-03-04 06:49:46,205 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 44 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-03-04 06:49:46,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 217 transitions, 590 flow [2025-03-04 06:49:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1052 transitions. [2025-03-04 06:49:46,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8389154704944178 [2025-03-04 06:49:46,211 INFO L175 Difference]: Start difference. First operand has 194 places, 195 transitions, 448 flow. Second operand 6 states and 1052 transitions. [2025-03-04 06:49:46,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 217 transitions, 590 flow [2025-03-04 06:49:46,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 217 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:49:46,219 INFO L231 Difference]: Finished difference. Result has 201 places, 197 transitions, 472 flow [2025-03-04 06:49:46,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=472, PETRI_PLACES=201, PETRI_TRANSITIONS=197} [2025-03-04 06:49:46,220 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, 5 predicate places. [2025-03-04 06:49:46,221 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 197 transitions, 472 flow [2025-03-04 06:49:46,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 168.6) internal successors, (843), 5 states have internal predecessors, (843), 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-03-04 06:49:46,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:46,222 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 06:49:46,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:49:46,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-04 06:49:46,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash -124911136, now seen corresponding path program 1 times [2025-03-04 06:49:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495943342] [2025-03-04 06:49:46,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:46,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:49:46,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:49:46,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:46,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:46,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:49:46,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:49:46,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:49:46,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:46,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:49:46,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:49:46,280 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:49:46,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 06:49:46,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-04 06:49:46,280 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-04 06:49:46,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-04 06:49:46,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-04 06:49:46,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-04 06:49:46,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-04 06:49:46,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-04 06:49:46,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-04 06:49:46,281 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-04 06:49:46,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:49:46,281 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 06:49:46,283 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:49:46,283 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:49:46,304 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:49:46,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 241 transitions, 509 flow [2025-03-04 06:49:46,339 INFO L124 PetriNetUnfolderBase]: 52/656 cut-off events. [2025-03-04 06:49:46,339 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 06:49:46,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 656 events. 52/656 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2902 event pairs, 1 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 456. Up to 12 conditions per place. [2025-03-04 06:49:46,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 241 transitions, 509 flow [2025-03-04 06:49:46,344 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 241 transitions, 509 flow [2025-03-04 06:49:46,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:49:46,345 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;@608cdd79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:49:46,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 06:49:46,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:49:46,347 INFO L124 PetriNetUnfolderBase]: 0/54 cut-off events. [2025-03-04 06:49:46,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:49:46,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:46,348 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] [2025-03-04 06:49:46,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:49:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1384606018, now seen corresponding path program 1 times [2025-03-04 06:49:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173544150] [2025-03-04 06:49:46,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:46,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:46,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:49:46,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:49:46,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:46,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:46,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:46,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173544150] [2025-03-04 06:49:46,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173544150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:46,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:46,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:49:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208429135] [2025-03-04 06:49:46,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:46,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:49:46,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:46,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:49:46,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:49:46,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 241 [2025-03-04 06:49:46,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 241 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 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-03-04 06:49:46,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:46,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 241 [2025-03-04 06:49:46,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:48,888 INFO L124 PetriNetUnfolderBase]: 8120/26896 cut-off events. [2025-03-04 06:49:48,889 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2025-03-04 06:49:48,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38631 conditions, 26896 events. 8120/26896 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 324669 event pairs, 913 based on Foata normal form. 6161/31231 useless extension candidates. Maximal degree in co-relation 6257. Up to 8631 conditions per place. [2025-03-04 06:49:49,018 INFO L140 encePairwiseOnDemand]: 217/241 looper letters, 84 selfloop transitions, 5 changer transitions 0/264 dead transitions. [2025-03-04 06:49:49,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 264 transitions, 733 flow [2025-03-04 06:49:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:49:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:49:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2025-03-04 06:49:49,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464730290456431 [2025-03-04 06:49:49,021 INFO L175 Difference]: Start difference. First operand has 225 places, 241 transitions, 509 flow. Second operand 6 states and 1224 transitions. [2025-03-04 06:49:49,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 264 transitions, 733 flow [2025-03-04 06:49:49,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 264 transitions, 733 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:49:49,024 INFO L231 Difference]: Finished difference. Result has 223 places, 216 transitions, 469 flow [2025-03-04 06:49:49,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=223, PETRI_TRANSITIONS=216} [2025-03-04 06:49:49,025 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -2 predicate places. [2025-03-04 06:49:49,025 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 216 transitions, 469 flow [2025-03-04 06:49:49,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 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-03-04 06:49:49,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:49,026 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] [2025-03-04 06:49:49,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:49:49,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:49:49,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1863278876, now seen corresponding path program 1 times [2025-03-04 06:49:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:49,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769742519] [2025-03-04 06:49:49,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:49,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:49,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:49:49,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:49:49,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:49,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:49,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:49,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769742519] [2025-03-04 06:49:49,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769742519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:49,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:49,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:49:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882735794] [2025-03-04 06:49:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:49,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:49,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:49,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:49,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:49,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 241 [2025-03-04 06:49:49,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 216 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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-03-04 06:49:49,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:49,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 241 [2025-03-04 06:49:49,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:49:55,936 INFO L124 PetriNetUnfolderBase]: 27273/82403 cut-off events. [2025-03-04 06:49:55,937 INFO L125 PetriNetUnfolderBase]: For 2640/5160 co-relation queries the response was YES. [2025-03-04 06:49:56,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122066 conditions, 82403 events. 27273/82403 cut-off events. For 2640/5160 co-relation queries the response was YES. Maximal size of possible extension queue 1786. Compared 1095187 event pairs, 10995 based on Foata normal form. 29/74696 useless extension candidates. Maximal degree in co-relation 103493. Up to 25188 conditions per place. [2025-03-04 06:49:56,464 INFO L140 encePairwiseOnDemand]: 226/241 looper letters, 60 selfloop transitions, 10 changer transitions 0/245 dead transitions. [2025-03-04 06:49:56,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 245 transitions, 688 flow [2025-03-04 06:49:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:49:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:49:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2025-03-04 06:49:56,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464730290456431 [2025-03-04 06:49:56,466 INFO L175 Difference]: Start difference. First operand has 223 places, 216 transitions, 469 flow. Second operand 3 states and 612 transitions. [2025-03-04 06:49:56,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 245 transitions, 688 flow [2025-03-04 06:49:56,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 245 transitions, 678 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:49:56,472 INFO L231 Difference]: Finished difference. Result has 220 places, 222 transitions, 533 flow [2025-03-04 06:49:56,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=533, PETRI_PLACES=220, PETRI_TRANSITIONS=222} [2025-03-04 06:49:56,473 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -5 predicate places. [2025-03-04 06:49:56,473 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 222 transitions, 533 flow [2025-03-04 06:49:56,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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-03-04 06:49:56,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:49:56,474 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] [2025-03-04 06:49:56,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:49:56,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:49:56,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:49:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2065647738, now seen corresponding path program 1 times [2025-03-04 06:49:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:49:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233007531] [2025-03-04 06:49:56,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:49:56,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:49:56,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:49:56,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:49:56,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:49:56,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:49:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:49:56,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:49:56,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233007531] [2025-03-04 06:49:56,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233007531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:49:56,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:49:56,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:49:56,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740745128] [2025-03-04 06:49:56,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:49:56,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:49:56,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:49:56,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:49:56,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:49:56,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 241 [2025-03-04 06:49:56,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 222 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 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-03-04 06:49:56,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:49:56,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 241 [2025-03-04 06:49:56,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:02,721 INFO L124 PetriNetUnfolderBase]: 16115/65359 cut-off events. [2025-03-04 06:50:02,722 INFO L125 PetriNetUnfolderBase]: For 4103/5461 co-relation queries the response was YES. [2025-03-04 06:50:02,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94338 conditions, 65359 events. 16115/65359 cut-off events. For 4103/5461 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 932819 event pairs, 9055 based on Foata normal form. 1/59060 useless extension candidates. Maximal degree in co-relation 41046. Up to 19175 conditions per place. [2025-03-04 06:50:03,092 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 33 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2025-03-04 06:50:03,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 227 transitions, 613 flow [2025-03-04 06:50:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 606 transitions. [2025-03-04 06:50:03,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8381742738589212 [2025-03-04 06:50:03,094 INFO L175 Difference]: Start difference. First operand has 220 places, 222 transitions, 533 flow. Second operand 3 states and 606 transitions. [2025-03-04 06:50:03,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 227 transitions, 613 flow [2025-03-04 06:50:03,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 227 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:03,118 INFO L231 Difference]: Finished difference. Result has 221 places, 223 transitions, 525 flow [2025-03-04 06:50:03,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=221, PETRI_TRANSITIONS=223} [2025-03-04 06:50:03,118 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -4 predicate places. [2025-03-04 06:50:03,118 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 223 transitions, 525 flow [2025-03-04 06:50:03,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 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-03-04 06:50:03,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:03,119 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] [2025-03-04 06:50:03,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:50:03,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:50:03,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1029192763, now seen corresponding path program 1 times [2025-03-04 06:50:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245548514] [2025-03-04 06:50:03,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:03,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:50:03,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:50:03,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:03,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:50:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245548514] [2025-03-04 06:50:03,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245548514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:03,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:03,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811647413] [2025-03-04 06:50:03,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:03,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:50:03,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:03,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:50:03,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:50:03,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 241 [2025-03-04 06:50:03,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 223 transitions, 525 flow. Second operand has 5 states, 5 states have (on average 189.6) internal successors, (948), 5 states have internal predecessors, (948), 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-03-04 06:50:03,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:03,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 241 [2025-03-04 06:50:03,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:09,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [139#L715-2true, 9#L708true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 137#L715-2true, 98#L715-9true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:09,864 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [139#L715-2true, 9#L708true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 137#L715-2true, 157#L715-8true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:09,864 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [139#L715-2true, 9#L708true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 213#L715-2true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:09,864 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:50:09,864 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [171#ULTIMATE.startFINALtrue, 139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 137#L715-2true, 243#true, 98#L715-9true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:09,917 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [171#ULTIMATE.startFINALtrue, 139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 157#L715-8true, 137#L715-2true, 243#true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:09,917 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [171#ULTIMATE.startFINALtrue, 139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 213#L715-2true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:09,917 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-03-04 06:50:09,917 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 137#L715-2true, 243#true, 98#L715-9true, 226#true, 239#true, 222#true, Black: 234#true, 10#L709-36true]) [2025-03-04 06:50:09,962 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 137#L715-2true, 243#true, 157#L715-8true, 226#true, 239#true, 222#true, Black: 234#true, 10#L709-36true]) [2025-03-04 06:50:09,962 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 213#L715-2true, 226#true, 239#true, 222#true, Black: 234#true, 10#L709-36true]) [2025-03-04 06:50:09,962 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-04 06:50:09,962 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-04 06:50:09,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [9#L708true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 137#L715-2true, 98#L715-9true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,000 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [9#L708true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 137#L715-2true, 157#L715-8true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,000 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [9#L708true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 213#L715-2true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,000 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-04 06:50:10,000 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-04 06:50:10,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][190], [139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 157#L715-8true, 131#L715-9true, 93#L709-33true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:10,007 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-03-04 06:50:10,007 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-04 06:50:10,007 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:50:10,007 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][190], [139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 98#L715-9true, 93#L709-33true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:10,008 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][190], [139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 131#L715-9true, 98#L715-9true, 93#L709-33true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:10,008 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][190], [139#L715-2true, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 157#L715-8true, 93#L709-33true, 226#true, 239#true, 222#true, Black: 234#true]) [2025-03-04 06:50:10,008 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:50:10,008 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-04 06:50:10,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [171#ULTIMATE.startFINALtrue, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 137#L715-2true, 243#true, 98#L715-9true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,050 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-04 06:50:10,053 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-04 06:50:10,054 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-04 06:50:10,054 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-03-04 06:50:10,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [171#ULTIMATE.startFINALtrue, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 137#L715-2true, 243#true, 157#L715-8true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,054 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-04 06:50:10,054 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-04 06:50:10,054 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:50:10,054 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:50:10,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [171#ULTIMATE.startFINALtrue, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 213#L715-2true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,058 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-03-04 06:50:10,058 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-03-04 06:50:10,058 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:50:10,058 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:50:10,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 137#L715-2true, 98#L715-9true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true, 10#L709-36true]) [2025-03-04 06:50:10,106 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-03-04 06:50:10,106 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-04 06:50:10,106 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-04 06:50:10,106 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-03-04 06:50:10,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 157#L715-8true, 243#true, 137#L715-2true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true, 10#L709-36true]) [2025-03-04 06:50:10,106 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-04 06:50:10,106 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-04 06:50:10,106 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-04 06:50:10,106 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-03-04 06:50:10,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 213#L715-2true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true, 10#L709-36true]) [2025-03-04 06:50:10,106 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-03-04 06:50:10,107 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-04 06:50:10,107 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-04 06:50:10,107 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-03-04 06:50:10,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][190], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 157#L715-8true, 131#L715-9true, 93#L709-33true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,145 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-04 06:50:10,145 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:50:10,145 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:50:10,145 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][190], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 98#L715-9true, 93#L709-33true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,146 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][190], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 131#L715-9true, 98#L715-9true, 93#L709-33true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,146 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([782] L709-35-->L709-33: Formula: (= |v_#race~glob~0_12| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_12|} AuxVars[] AssignedVars[#race~glob~0][190], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 157#L715-8true, 93#L709-33true, 226#true, 239#true, 222#true, Black: 234#true, 119#L716true]) [2025-03-04 06:50:10,146 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-04 06:50:10,146 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-04 06:50:10,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 137#L715-2true, 221#true, 98#L715-9true, 11#L722-3true, 226#true, 239#true, Black: 234#true]) [2025-03-04 06:50:10,209 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-03-04 06:50:10,209 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-04 06:50:10,209 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-03-04 06:50:10,209 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-03-04 06:50:10,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 137#L715-2true, 157#L715-8true, 221#true, 11#L722-3true, 226#true, 239#true, Black: 234#true]) [2025-03-04 06:50:10,210 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-04 06:50:10,210 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-04 06:50:10,210 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-03-04 06:50:10,210 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-03-04 06:50:10,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 221#true, 213#L715-2true, 11#L722-3true, 226#true, 239#true, Black: 234#true]) [2025-03-04 06:50:10,210 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-03-04 06:50:10,210 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-03-04 06:50:10,210 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-03-04 06:50:10,210 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-04 06:50:10,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [171#ULTIMATE.startFINALtrue, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 221#true, 243#true, 137#L715-2true, 98#L715-9true, 226#true, 239#true, Black: 234#true]) [2025-03-04 06:50:10,662 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-03-04 06:50:10,662 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-04 06:50:10,662 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-04 06:50:10,662 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-03-04 06:50:10,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([902] L715-5-->L715-2: Formula: (and (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [171#ULTIMATE.startFINALtrue, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 243#true, 137#L715-2true, 157#L715-8true, 221#true, 226#true, 239#true, Black: 234#true]) [2025-03-04 06:50:10,663 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2025-03-04 06:50:10,663 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-04 06:50:10,663 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-04 06:50:10,663 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-04 06:50:10,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([872] L715-5-->L715-2: Formula: (and (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_73| (store |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31| (store (select |v_#pthreadsMutex_74| |v_~#__global_lock~0.base_31|) |v_~#__global_lock~0.offset_31| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_74|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_73|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_31|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_31|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [171#ULTIMATE.startFINALtrue, Black: 241#(= |ULTIMATE.start_main_~i~1#1| 0), 224#true, 29#L715-8true, 243#true, 221#true, 213#L715-2true, 226#true, 239#true, Black: 234#true]) [2025-03-04 06:50:10,663 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2025-03-04 06:50:10,663 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2025-03-04 06:50:10,663 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-04 06:50:10,663 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-03-04 06:50:10,754 INFO L124 PetriNetUnfolderBase]: 17529/82809 cut-off events. [2025-03-04 06:50:10,754 INFO L125 PetriNetUnfolderBase]: For 2152/2226 co-relation queries the response was YES. [2025-03-04 06:50:11,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110630 conditions, 82809 events. 17529/82809 cut-off events. For 2152/2226 co-relation queries the response was YES. Maximal size of possible extension queue 1343. Compared 1248582 event pairs, 6187 based on Foata normal form. 5/74892 useless extension candidates. Maximal degree in co-relation 96549. Up to 20381 conditions per place. [2025-03-04 06:50:11,213 INFO L140 encePairwiseOnDemand]: 236/241 looper letters, 52 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2025-03-04 06:50:11,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 247 transitions, 689 flow [2025-03-04 06:50:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2025-03-04 06:50:11,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8201936376210235 [2025-03-04 06:50:11,215 INFO L175 Difference]: Start difference. First operand has 221 places, 223 transitions, 525 flow. Second operand 6 states and 1186 transitions. [2025-03-04 06:50:11,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 247 transitions, 689 flow [2025-03-04 06:50:11,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 247 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:11,219 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 555 flow [2025-03-04 06:50:11,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2025-03-04 06:50:11,220 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, 3 predicate places. [2025-03-04 06:50:11,220 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 555 flow [2025-03-04 06:50:11,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.6) internal successors, (948), 5 states have internal predecessors, (948), 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-03-04 06:50:11,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:11,221 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 06:50:11,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:50:11,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 06:50:11,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:11,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1214039259, now seen corresponding path program 1 times [2025-03-04 06:50:11,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488734742] [2025-03-04 06:50:11,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:11,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:50:11,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:50:11,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:11,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:50:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:11,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488734742] [2025-03-04 06:50:11,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488734742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:11,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:11,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:11,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511628271] [2025-03-04 06:50:11,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:11,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:11,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:11,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:11,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:11,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 241 [2025-03-04 06:50:11,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-03-04 06:50:11,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:11,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 241 [2025-03-04 06:50:11,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:22,056 INFO L124 PetriNetUnfolderBase]: 28122/116898 cut-off events. [2025-03-04 06:50:22,056 INFO L125 PetriNetUnfolderBase]: For 1437/1437 co-relation queries the response was YES. [2025-03-04 06:50:22,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162543 conditions, 116898 events. 28122/116898 cut-off events. For 1437/1437 co-relation queries the response was YES. Maximal size of possible extension queue 2408. Compared 1836013 event pairs, 16827 based on Foata normal form. 242/106322 useless extension candidates. Maximal degree in co-relation 162406. Up to 22645 conditions per place.