./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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_20-callback_racefree.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 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:01:56,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:01:56,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:01:56,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:01:56,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:01:56,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:01:56,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:01:56,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:01:56,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:01:56,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:01:56,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:01:56,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:01:56,204 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:01:56,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:01:56,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:01:56,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:01:56,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:01:56,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:01:56,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:01:56,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:01:56,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:01:56,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:01:56,205 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:01:56,205 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:01:56,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:01:56,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:01:56,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:01:56,206 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 -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2025-03-08 22:01:56,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:01:56,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:01:56,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:01:56,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:01:56,417 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:01:56,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-03-08 22:01:57,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a5c6f7d/edc7f56939fd450794319f3cac74dd02/FLAGc2cb14239 [2025-03-08 22:01:57,879 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:01:57,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-03-08 22:01:57,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a5c6f7d/edc7f56939fd450794319f3cac74dd02/FLAGc2cb14239 [2025-03-08 22:01:58,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a5c6f7d/edc7f56939fd450794319f3cac74dd02 [2025-03-08 22:01:58,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:01:58,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:01:58,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:01:58,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:01:58,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:01:58,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eec23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58, skipping insertion in model container [2025-03-08 22:01:58,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:01:58,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:01:58,402 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:01:58,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:01:58,460 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:01:58,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58 WrapperNode [2025-03-08 22:01:58,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:01:58,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:01:58,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:01:58,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:01:58,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,493 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 209 [2025-03-08 22:01:58,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:01:58,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:01:58,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:01:58,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:01:58,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:01:58,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:01:58,518 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:01:58,518 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:01:58,519 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (1/1) ... [2025-03-08 22:01:58,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:01:58,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:01:58,548 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-08 22:01:58,553 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-08 22:01:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:01:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:01:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:01:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:01:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:01:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:01:58,567 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:01:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:01:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:01:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:01:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:01:58,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:01:58,569 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:01:58,673 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:01:58,675 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:01:58,939 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 22:01:58,939 INFO L1307 $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-08 22:01:58,971 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:01:58,971 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:01:58,997 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:01:58,997 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:01:58,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:01:58 BoogieIcfgContainer [2025-03-08 22:01:58,998 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:01:59,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:01:59,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:01:59,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:01:59,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:01:58" (1/3) ... [2025-03-08 22:01:59,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:01:59, skipping insertion in model container [2025-03-08 22:01:59,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:58" (2/3) ... [2025-03-08 22:01:59,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:01:59, skipping insertion in model container [2025-03-08 22:01:59,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:01:58" (3/3) ... [2025-03-08 22:01:59,006 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2025-03-08 22:01:59,019 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:01:59,020 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_20-callback_racefree.i that has 2 procedures, 214 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-03-08 22:01:59,023 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:01:59,080 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:01:59,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 227 transitions, 461 flow [2025-03-08 22:01:59,220 INFO L124 PetriNetUnfolderBase]: 21/333 cut-off events. [2025-03-08 22:01:59,221 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:01:59,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 333 events. 21/333 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 977 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 188. Up to 6 conditions per place. [2025-03-08 22:01:59,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 227 transitions, 461 flow [2025-03-08 22:01:59,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 227 transitions, 461 flow [2025-03-08 22:01:59,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:01:59,250 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;@54dec5c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:01:59,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-08 22:01:59,272 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:01:59,272 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-03-08 22:01:59,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:01:59,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:59,273 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:01:59,273 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-08 22:01:59,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:59,277 INFO L85 PathProgramCache]: Analyzing trace with hash -362527012, now seen corresponding path program 1 times [2025-03-08 22:01:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139771581] [2025-03-08 22:01:59,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:59,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 22:01:59,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 22:01:59,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:59,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:00,075 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-08 22:02:00,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:00,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139771581] [2025-03-08 22:02:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139771581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:00,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:00,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:00,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695825889] [2025-03-08 22:02:00,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:00,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:00,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:00,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:00,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:00,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 227 [2025-03-08 22:02:00,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 227 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 187.5) internal successors, (1125), 6 states have internal predecessors, (1125), 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-08 22:02:00,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:00,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 227 [2025-03-08 22:02:00,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:00,456 INFO L124 PetriNetUnfolderBase]: 93/835 cut-off events. [2025-03-08 22:02:00,456 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:02:00,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 835 events. 93/835 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4493 event pairs, 8 based on Foata normal form. 77/850 useless extension candidates. Maximal degree in co-relation 832. Up to 154 conditions per place. [2025-03-08 22:02:00,464 INFO L140 encePairwiseOnDemand]: 211/227 looper letters, 40 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2025-03-08 22:02:00,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 230 transitions, 557 flow [2025-03-08 22:02:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:00,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1188 transitions. [2025-03-08 22:02:00,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8722466960352423 [2025-03-08 22:02:00,484 INFO L175 Difference]: Start difference. First operand has 217 places, 227 transitions, 461 flow. Second operand 6 states and 1188 transitions. [2025-03-08 22:02:00,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 230 transitions, 557 flow [2025-03-08 22:02:00,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 230 transitions, 557 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:00,491 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 445 flow [2025-03-08 22:02:00,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=445, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2025-03-08 22:02:00,496 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 2 predicate places. [2025-03-08 22:02:00,496 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 445 flow [2025-03-08 22:02:00,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.5) internal successors, (1125), 6 states have internal predecessors, (1125), 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-08 22:02:00,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:00,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:00,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:02:00,498 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-08 22:02:00,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash 887055362, now seen corresponding path program 1 times [2025-03-08 22:02:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735740463] [2025-03-08 22:02:00,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:00,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:00,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 22:02:00,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:02:00,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:00,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:00,580 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-08 22:02:00,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:00,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735740463] [2025-03-08 22:02:00,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735740463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:00,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:00,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:00,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563109201] [2025-03-08 22:02:00,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:00,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:00,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:00,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:00,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 227 [2025-03-08 22:02:00,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-08 22:02:00,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:00,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 227 [2025-03-08 22:02:00,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:00,770 INFO L124 PetriNetUnfolderBase]: 113/970 cut-off events. [2025-03-08 22:02:00,770 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2025-03-08 22:02:00,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 970 events. 113/970 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4815 event pairs, 34 based on Foata normal form. 1/895 useless extension candidates. Maximal degree in co-relation 1024. Up to 137 conditions per place. [2025-03-08 22:02:00,773 INFO L140 encePairwiseOnDemand]: 218/227 looper letters, 30 selfloop transitions, 6 changer transitions 0/227 dead transitions. [2025-03-08 22:02:00,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 227 transitions, 546 flow [2025-03-08 22:02:00,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-03-08 22:02:00,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9074889867841409 [2025-03-08 22:02:00,775 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 445 flow. Second operand 3 states and 618 transitions. [2025-03-08 22:02:00,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 227 transitions, 546 flow [2025-03-08 22:02:00,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 227 transitions, 536 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:02:00,781 INFO L231 Difference]: Finished difference. Result has 216 places, 216 transitions, 473 flow [2025-03-08 22:02:00,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=216, PETRI_TRANSITIONS=216} [2025-03-08 22:02:00,784 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, -1 predicate places. [2025-03-08 22:02:00,784 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 216 transitions, 473 flow [2025-03-08 22:02:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-08 22:02:00,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:00,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:00,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:02:00,785 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-08 22:02:00,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash 836931995, now seen corresponding path program 1 times [2025-03-08 22:02:00,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:00,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008363450] [2025-03-08 22:02:00,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:00,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:00,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 22:02:00,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:02:00,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:00,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:00,860 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-08 22:02:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:00,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008363450] [2025-03-08 22:02:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008363450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:00,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493542646] [2025-03-08 22:02:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:00,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:00,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:00,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:00,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 227 [2025-03-08 22:02:00,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 216 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-08 22:02:00,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:00,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 227 [2025-03-08 22:02:00,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:01,004 INFO L124 PetriNetUnfolderBase]: 82/951 cut-off events. [2025-03-08 22:02:01,004 INFO L125 PetriNetUnfolderBase]: For 34/36 co-relation queries the response was YES. [2025-03-08 22:02:01,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 951 events. 82/951 cut-off events. For 34/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4754 event pairs, 38 based on Foata normal form. 1/886 useless extension candidates. Maximal degree in co-relation 1034. Up to 146 conditions per place. [2025-03-08 22:02:01,010 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 20 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-08 22:02:01,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 220 transitions, 525 flow [2025-03-08 22:02:01,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2025-03-08 22:02:01,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060205580029369 [2025-03-08 22:02:01,012 INFO L175 Difference]: Start difference. First operand has 216 places, 216 transitions, 473 flow. Second operand 3 states and 617 transitions. [2025-03-08 22:02:01,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 220 transitions, 525 flow [2025-03-08 22:02:01,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 220 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:01,018 INFO L231 Difference]: Finished difference. Result has 217 places, 216 transitions, 469 flow [2025-03-08 22:02:01,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=217, PETRI_TRANSITIONS=216} [2025-03-08 22:02:01,019 INFO L279 CegarLoopForPetriNet]: 217 programPoint places, 0 predicate places. [2025-03-08 22:02:01,019 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 216 transitions, 469 flow [2025-03-08 22:02:01,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-08 22:02:01,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:01,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:02:01,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:02:01,020 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-08 22:02:01,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1184748475, now seen corresponding path program 1 times [2025-03-08 22:02:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:01,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781865903] [2025-03-08 22:02:01,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:01,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:01,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:02:01,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:02:01,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:01,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:01,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:02:01,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:02:01,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:02:01,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:01,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:01,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:02:01,105 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:02:01,105 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-08 22:02:01,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-08 22:02:01,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-08 22:02:01,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-08 22:02:01,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-08 22:02:01,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-08 22:02:01,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-08 22:02:01,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-08 22:02:01,108 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-08 22:02:01,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:02:01,108 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 22:02:01,110 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:02:01,111 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:02:01,135 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:02:01,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 259 transitions, 534 flow [2025-03-08 22:02:01,187 INFO L124 PetriNetUnfolderBase]: 35/498 cut-off events. [2025-03-08 22:02:01,188 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:02:01,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 498 events. 35/498 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1810 event pairs, 0 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 335. Up to 9 conditions per place. [2025-03-08 22:02:01,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 259 transitions, 534 flow [2025-03-08 22:02:01,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 259 transitions, 534 flow [2025-03-08 22:02:01,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:01,194 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;@54dec5c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:01,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-08 22:02:01,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:01,200 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-03-08 22:02:01,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:01,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:01,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:01,201 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-08 22:02:01,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2122944540, now seen corresponding path program 1 times [2025-03-08 22:02:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:01,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048272482] [2025-03-08 22:02:01,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:01,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 22:02:01,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 22:02:01,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:01,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:01,530 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-08 22:02:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:01,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048272482] [2025-03-08 22:02:01,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048272482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:01,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:01,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:01,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100671482] [2025-03-08 22:02:01,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:01,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:01,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:01,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:01,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 259 [2025-03-08 22:02:01,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 259 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 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-08 22:02:01,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:01,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 259 [2025-03-08 22:02:01,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:02,152 INFO L124 PetriNetUnfolderBase]: 1001/4637 cut-off events. [2025-03-08 22:02:02,152 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-08 22:02:02,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6296 conditions, 4637 events. 1001/4637 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 42752 event pairs, 262 based on Foata normal form. 765/5072 useless extension candidates. Maximal degree in co-relation 1828. Up to 1202 conditions per place. [2025-03-08 22:02:02,173 INFO L140 encePairwiseOnDemand]: 239/259 looper letters, 62 selfloop transitions, 5 changer transitions 0/272 dead transitions. [2025-03-08 22:02:02,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 272 transitions, 694 flow [2025-03-08 22:02:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-03-08 22:02:02,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8725868725868726 [2025-03-08 22:02:02,175 INFO L175 Difference]: Start difference. First operand has 246 places, 259 transitions, 534 flow. Second operand 6 states and 1356 transitions. [2025-03-08 22:02:02,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 272 transitions, 694 flow [2025-03-08 22:02:02,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 272 transitions, 694 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:02,179 INFO L231 Difference]: Finished difference. Result has 246 places, 240 transitions, 506 flow [2025-03-08 22:02:02,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=246, PETRI_TRANSITIONS=240} [2025-03-08 22:02:02,180 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 0 predicate places. [2025-03-08 22:02:02,180 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 240 transitions, 506 flow [2025-03-08 22:02:02,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 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-08 22:02:02,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:02,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:02,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:02:02,181 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-08 22:02:02,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash -73686812, now seen corresponding path program 1 times [2025-03-08 22:02:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:02,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611538884] [2025-03-08 22:02:02,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:02,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:02,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 22:02:02,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:02:02,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:02,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:02,224 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-08 22:02:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:02,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611538884] [2025-03-08 22:02:02,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611538884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:02,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:02,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118234256] [2025-03-08 22:02:02,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:02,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:02,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:02,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:02,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 259 [2025-03-08 22:02:02,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 240 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-08 22:02:02,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:02,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 259 [2025-03-08 22:02:02,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:03,189 INFO L124 PetriNetUnfolderBase]: 2103/8713 cut-off events. [2025-03-08 22:02:03,190 INFO L125 PetriNetUnfolderBase]: For 158/285 co-relation queries the response was YES. [2025-03-08 22:02:03,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12237 conditions, 8713 events. 2103/8713 cut-off events. For 158/285 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 86168 event pairs, 747 based on Foata normal form. 8/7925 useless extension candidates. Maximal degree in co-relation 10950. Up to 2127 conditions per place. [2025-03-08 22:02:03,235 INFO L140 encePairwiseOnDemand]: 247/259 looper letters, 45 selfloop transitions, 8 changer transitions 0/261 dead transitions. [2025-03-08 22:02:03,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 261 transitions, 665 flow [2025-03-08 22:02:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2025-03-08 22:02:03,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888030888030888 [2025-03-08 22:02:03,237 INFO L175 Difference]: Start difference. First operand has 246 places, 240 transitions, 506 flow. Second operand 3 states and 690 transitions. [2025-03-08 22:02:03,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 261 transitions, 665 flow [2025-03-08 22:02:03,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 261 transitions, 655 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:02:03,241 INFO L231 Difference]: Finished difference. Result has 243 places, 244 transitions, 552 flow [2025-03-08 22:02:03,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=243, PETRI_TRANSITIONS=244} [2025-03-08 22:02:03,242 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -3 predicate places. [2025-03-08 22:02:03,242 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 244 transitions, 552 flow [2025-03-08 22:02:03,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-08 22:02:03,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:03,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:03,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:02:03,243 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-08 22:02:03,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash -868512677, now seen corresponding path program 1 times [2025-03-08 22:02:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571306667] [2025-03-08 22:02:03,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:03,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 22:02:03,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:02:03,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:03,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:03,287 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-08 22:02:03,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571306667] [2025-03-08 22:02:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571306667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97312607] [2025-03-08 22:02:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:03,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:03,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:03,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:03,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:03,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 259 [2025-03-08 22:02:03,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 244 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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-08 22:02:03,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:03,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 259 [2025-03-08 22:02:03,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:04,023 INFO L124 PetriNetUnfolderBase]: 1362/7558 cut-off events. [2025-03-08 22:02:04,023 INFO L125 PetriNetUnfolderBase]: For 374/455 co-relation queries the response was YES. [2025-03-08 22:02:04,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10372 conditions, 7558 events. 1362/7558 cut-off events. For 374/455 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 76424 event pairs, 874 based on Foata normal form. 1/6915 useless extension candidates. Maximal degree in co-relation 6766. Up to 1911 conditions per place. [2025-03-08 22:02:04,058 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 27 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-03-08 22:02:04,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 249 transitions, 620 flow [2025-03-08 22:02:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions. [2025-03-08 22:02:04,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8841698841698842 [2025-03-08 22:02:04,061 INFO L175 Difference]: Start difference. First operand has 243 places, 244 transitions, 552 flow. Second operand 3 states and 687 transitions. [2025-03-08 22:02:04,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 249 transitions, 620 flow [2025-03-08 22:02:04,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 249 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:04,068 INFO L231 Difference]: Finished difference. Result has 244 places, 245 transitions, 548 flow [2025-03-08 22:02:04,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=244, PETRI_TRANSITIONS=245} [2025-03-08 22:02:04,070 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -2 predicate places. [2025-03-08 22:02:04,071 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 245 transitions, 548 flow [2025-03-08 22:02:04,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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-08 22:02:04,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:04,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:04,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:02:04,072 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-08 22:02:04,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1748162252, now seen corresponding path program 1 times [2025-03-08 22:02:04,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:04,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835867090] [2025-03-08 22:02:04,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:04,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:04,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:02:04,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:02:04,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:04,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:04,177 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-08 22:02:04,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:04,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835867090] [2025-03-08 22:02:04,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835867090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:04,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:04,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:04,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699414132] [2025-03-08 22:02:04,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:04,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:02:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:04,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:02:04,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:02:04,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 259 [2025-03-08 22:02:04,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 245 transitions, 548 flow. Second operand has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 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-08 22:02:04,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:04,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 259 [2025-03-08 22:02:04,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:05,230 INFO L124 PetriNetUnfolderBase]: 1405/8987 cut-off events. [2025-03-08 22:02:05,231 INFO L125 PetriNetUnfolderBase]: For 151/155 co-relation queries the response was YES. [2025-03-08 22:02:05,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11575 conditions, 8987 events. 1405/8987 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 94717 event pairs, 240 based on Foata normal form. 5/8228 useless extension candidates. Maximal degree in co-relation 8524. Up to 1720 conditions per place. [2025-03-08 22:02:05,267 INFO L140 encePairwiseOnDemand]: 254/259 looper letters, 44 selfloop transitions, 5 changer transitions 0/267 dead transitions. [2025-03-08 22:02:05,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 267 transitions, 690 flow [2025-03-08 22:02:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:05,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1352 transitions. [2025-03-08 22:02:05,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.87001287001287 [2025-03-08 22:02:05,273 INFO L175 Difference]: Start difference. First operand has 244 places, 245 transitions, 548 flow. Second operand 6 states and 1352 transitions. [2025-03-08 22:02:05,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 267 transitions, 690 flow [2025-03-08 22:02:05,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 267 transitions, 688 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:05,278 INFO L231 Difference]: Finished difference. Result has 251 places, 247 transitions, 572 flow [2025-03-08 22:02:05,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=251, PETRI_TRANSITIONS=247} [2025-03-08 22:02:05,279 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, 5 predicate places. [2025-03-08 22:02:05,279 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 247 transitions, 572 flow [2025-03-08 22:02:05,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 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-08 22:02:05,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:05,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:02:05,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:02:05,280 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-08 22:02:05,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1955182636, now seen corresponding path program 1 times [2025-03-08 22:02:05,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:05,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137080452] [2025-03-08 22:02:05,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:05,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:05,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 22:02:05,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 22:02:05,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:05,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:02:05,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 22:02:05,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 22:02:05,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:05,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:02:05,340 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-08 22:02:05,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-08 22:02:05,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:02:05,341 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 22:02:05,342 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:02:05,342 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 22:02:05,364 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:02:05,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 291 transitions, 609 flow [2025-03-08 22:02:05,405 INFO L124 PetriNetUnfolderBase]: 52/706 cut-off events. [2025-03-08 22:02:05,405 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 22:02:05,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 706 events. 52/706 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2901 event pairs, 1 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 506. Up to 12 conditions per place. [2025-03-08 22:02:05,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 291 transitions, 609 flow [2025-03-08 22:02:05,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 291 transitions, 609 flow [2025-03-08 22:02:05,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:05,411 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;@54dec5c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:05,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 22:02:05,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:05,414 INFO L124 PetriNetUnfolderBase]: 0/104 cut-off events. [2025-03-08 22:02:05,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:05,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:05,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:05,415 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-08 22:02:05,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1303080612, now seen corresponding path program 1 times [2025-03-08 22:02:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670300771] [2025-03-08 22:02:05,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:05,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 22:02:05,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 22:02:05,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:05,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:05,636 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-08 22:02:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670300771] [2025-03-08 22:02:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670300771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:05,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444029152] [2025-03-08 22:02:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:05,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:05,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:05,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:05,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:05,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 291 [2025-03-08 22:02:05,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 291 transitions, 609 flow. Second operand has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 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-08 22:02:05,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:05,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 291 [2025-03-08 22:02:05,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:08,282 INFO L124 PetriNetUnfolderBase]: 8093/25968 cut-off events. [2025-03-08 22:02:08,283 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-03-08 22:02:08,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37703 conditions, 25968 events. 8093/25968 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 306800 event pairs, 2597 based on Foata normal form. 6180/30502 useless extension candidates. Maximal degree in co-relation 6203. Up to 8631 conditions per place. [2025-03-08 22:02:08,471 INFO L140 encePairwiseOnDemand]: 267/291 looper letters, 84 selfloop transitions, 5 changer transitions 0/314 dead transitions. [2025-03-08 22:02:08,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 314 transitions, 833 flow [2025-03-08 22:02:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1524 transitions. [2025-03-08 22:02:08,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872852233676976 [2025-03-08 22:02:08,474 INFO L175 Difference]: Start difference. First operand has 275 places, 291 transitions, 609 flow. Second operand 6 states and 1524 transitions. [2025-03-08 22:02:08,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 314 transitions, 833 flow [2025-03-08 22:02:08,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 314 transitions, 833 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:08,479 INFO L231 Difference]: Finished difference. Result has 273 places, 266 transitions, 569 flow [2025-03-08 22:02:08,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=273, PETRI_TRANSITIONS=266} [2025-03-08 22:02:08,480 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -2 predicate places. [2025-03-08 22:02:08,480 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 266 transitions, 569 flow [2025-03-08 22:02:08,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 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-08 22:02:08,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:08,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:08,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:02:08,481 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-08 22:02:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1109262462, now seen corresponding path program 1 times [2025-03-08 22:02:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802088948] [2025-03-08 22:02:08,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:08,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 22:02:08,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:02:08,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:08,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:08,527 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-08 22:02:08,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802088948] [2025-03-08 22:02:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802088948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:08,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:08,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:02:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277528315] [2025-03-08 22:02:08,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:08,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:08,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:08,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:08,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 291 [2025-03-08 22:02:08,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 266 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 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-08 22:02:08,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:08,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 291 [2025-03-08 22:02:08,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:16,284 INFO L124 PetriNetUnfolderBase]: 27273/82453 cut-off events. [2025-03-08 22:02:16,285 INFO L125 PetriNetUnfolderBase]: For 2640/5160 co-relation queries the response was YES. [2025-03-08 22:02:16,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122116 conditions, 82453 events. 27273/82453 cut-off events. For 2640/5160 co-relation queries the response was YES. Maximal size of possible extension queue 1779. Compared 1094166 event pairs, 10995 based on Foata normal form. 29/74746 useless extension candidates. Maximal degree in co-relation 103493. Up to 25188 conditions per place. [2025-03-08 22:02:16,705 INFO L140 encePairwiseOnDemand]: 276/291 looper letters, 60 selfloop transitions, 10 changer transitions 0/295 dead transitions. [2025-03-08 22:02:16,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 295 transitions, 788 flow [2025-03-08 22:02:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2025-03-08 22:02:16,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872852233676976 [2025-03-08 22:02:16,707 INFO L175 Difference]: Start difference. First operand has 273 places, 266 transitions, 569 flow. Second operand 3 states and 762 transitions. [2025-03-08 22:02:16,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 295 transitions, 788 flow [2025-03-08 22:02:16,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 295 transitions, 778 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:02:16,712 INFO L231 Difference]: Finished difference. Result has 270 places, 272 transitions, 633 flow [2025-03-08 22:02:16,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=270, PETRI_TRANSITIONS=272} [2025-03-08 22:02:16,713 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -5 predicate places. [2025-03-08 22:02:16,713 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 272 transitions, 633 flow [2025-03-08 22:02:16,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 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-08 22:02:16,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:16,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:16,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:02:16,714 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-08 22:02:16,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1839444197, now seen corresponding path program 1 times [2025-03-08 22:02:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:16,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298372323] [2025-03-08 22:02:16,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:16,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 22:02:16,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 22:02:16,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:16,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:16,750 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-08 22:02:16,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298372323] [2025-03-08 22:02:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298372323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:16,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289400853] [2025-03-08 22:02:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:16,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:16,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:16,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:16,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 291 [2025-03-08 22:02:16,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 272 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-08 22:02:16,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:16,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 291 [2025-03-08 22:02:16,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:23,966 INFO L124 PetriNetUnfolderBase]: 16710/68546 cut-off events. [2025-03-08 22:02:23,967 INFO L125 PetriNetUnfolderBase]: For 4234/5494 co-relation queries the response was YES. [2025-03-08 22:02:24,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97984 conditions, 68546 events. 16710/68546 cut-off events. For 4234/5494 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 983393 event pairs, 11681 based on Foata normal form. 1/62252 useless extension candidates. Maximal degree in co-relation 64733. Up to 20086 conditions per place. [2025-03-08 22:02:24,395 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 33 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-03-08 22:02:24,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 277 transitions, 713 flow [2025-03-08 22:02:24,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 756 transitions. [2025-03-08 22:02:24,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.865979381443299 [2025-03-08 22:02:24,397 INFO L175 Difference]: Start difference. First operand has 270 places, 272 transitions, 633 flow. Second operand 3 states and 756 transitions. [2025-03-08 22:02:24,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 277 transitions, 713 flow [2025-03-08 22:02:24,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 277 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:24,418 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 625 flow [2025-03-08 22:02:24,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=625, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2025-03-08 22:02:24,419 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -4 predicate places. [2025-03-08 22:02:24,419 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 625 flow [2025-03-08 22:02:24,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-08 22:02:24,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:24,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:24,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:02:24,420 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-08 22:02:24,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:24,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1290326322, now seen corresponding path program 1 times [2025-03-08 22:02:24,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:24,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596110235] [2025-03-08 22:02:24,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:24,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:24,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:02:24,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:02:24,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:24,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:24,499 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-08 22:02:24,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:24,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596110235] [2025-03-08 22:02:24,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596110235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:24,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:24,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:24,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327206286] [2025-03-08 22:02:24,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:24,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:02:24,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:24,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:02:24,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:02:24,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 291 [2025-03-08 22:02:24,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 625 flow. Second operand has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 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-08 22:02:24,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:24,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 291 [2025-03-08 22:02:24,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:31,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] 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][175], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 168#L715-2true, 263#L715-2true, 272#true, 293#true, 10#L708true]) [2025-03-08 22:02:31,863 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-08 22:02:31,863 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:02:31,863 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-08 22:02:31,863 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:02:31,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 168#L715-2true, 272#true, 293#true, 10#L708true, 119#L715-9true]) [2025-03-08 22:02:31,863 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-08 22:02:31,863 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-08 22:02:31,863 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-08 22:02:31,863 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-08 22:02:31,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 168#L715-2true, 191#L715-8true, 272#true, 293#true, 10#L708true]) [2025-03-08 22:02:31,864 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-08 22:02:31,864 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:02:31,864 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-08 22:02:31,864 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] 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][175], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 168#L715-2true, 263#L715-2true, 272#true, 293#true]) [2025-03-08 22:02:31,922 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 168#L715-2true, 272#true, 293#true, 119#L715-9true]) [2025-03-08 22:02:31,922 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 168#L715-2true, 191#L715-8true, 272#true, 293#true]) [2025-03-08 22:02:31,922 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-08 22:02:31,922 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] 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][175], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 11#L709-36true, 168#L715-2true, 263#L715-2true, 272#true, 293#true]) [2025-03-08 22:02:31,971 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 11#L709-36true, 168#L715-2true, 272#true, 293#true, 119#L715-9true]) [2025-03-08 22:02:31,971 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 11#L709-36true, 168#L715-2true, 191#L715-8true, 272#true, 293#true]) [2025-03-08 22:02:31,971 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-08 22:02:31,971 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2025-03-08 22:02:32,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] 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][175], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 263#L715-2true, 272#true, 293#true, 10#L708true]) [2025-03-08 22:02:32,017 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-03-08 22:02:32,017 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-08 22:02:32,017 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-08 22:02:32,017 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-08 22:02:32,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 272#true, 293#true, 119#L715-9true, 10#L708true]) [2025-03-08 22:02:32,018 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-08 22:02:32,018 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-08 22:02:32,018 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-08 22:02:32,018 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-08 22:02:32,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 191#L715-8true, 272#true, 293#true, 10#L708true]) [2025-03-08 22:02:32,018 INFO L294 olderBase$Statistics]: this new event has 234 ancestors and is cut-off event [2025-03-08 22:02:32,018 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-08 22:02:32,018 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-08 22:02:32,018 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2025-03-08 22:02:32,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] 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][240], [Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 168#L715-2true, 191#L715-8true, 272#true, 293#true]) [2025-03-08 22:02:32,020 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2025-03-08 22:02:32,020 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2025-03-08 22:02:32,020 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-08 22:02:32,020 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2025-03-08 22:02:32,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] 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][240], [Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 276#true, 274#true, 168#L715-2true, 191#L715-8true, 272#true, 293#true, 158#L715-9true]) [2025-03-08 22:02:32,020 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2025-03-08 22:02:32,020 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-08 22:02:32,020 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-08 22:02:32,020 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-08 22:02:32,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] 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][240], [Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 168#L715-2true, 272#true, 293#true, 119#L715-9true]) [2025-03-08 22:02:32,021 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2025-03-08 22:02:32,021 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2025-03-08 22:02:32,021 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-08 22:02:32,021 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2025-03-08 22:02:32,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] 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][240], [Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 276#true, 274#true, 168#L715-2true, 272#true, 293#true, 119#L715-9true, 158#L715-9true]) [2025-03-08 22:02:32,021 INFO L294 olderBase$Statistics]: this new event has 229 ancestors and is cut-off event [2025-03-08 22:02:32,021 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2025-03-08 22:02:32,021 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-08 22:02:32,021 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] 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][175], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 263#L715-2true, 272#true, 293#true]) [2025-03-08 22:02:32,064 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 272#true, 293#true, 119#L715-9true]) [2025-03-08 22:02:32,064 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 191#L715-8true, 272#true, 293#true]) [2025-03-08 22:02:32,064 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-08 22:02:32,064 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] 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][175], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 11#L709-36true, 263#L715-2true, 272#true, 293#true]) [2025-03-08 22:02:32,101 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 11#L709-36true, 272#true, 293#true, 119#L715-9true]) [2025-03-08 22:02:32,101 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 146#L716true, 289#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 11#L709-36true, 191#L715-8true, 272#true, 293#true]) [2025-03-08 22:02:32,101 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-08 22:02:32,101 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] 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][240], [146#L716true, Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 191#L715-8true, 272#true, 293#true]) [2025-03-08 22:02:32,137 INFO L294 olderBase$Statistics]: this new event has 230 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 230 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] 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][240], [146#L716true, Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 276#true, 274#true, 191#L715-8true, 272#true, 293#true, 158#L715-9true]) [2025-03-08 22:02:32,137 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] 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][240], [146#L716true, Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 272#true, 293#true, 119#L715-9true]) [2025-03-08 22:02:32,137 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] 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][240], [146#L716true, Black: 284#true, 289#true, 114#L709-33true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 276#true, 274#true, 272#true, 293#true, 119#L715-9true, 158#L715-9true]) [2025-03-08 22:02:32,137 INFO L294 olderBase$Statistics]: this new event has 232 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 232 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-08 22:02:32,137 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] 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][175], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 12#L722-3true, 276#true, 274#true, 263#L715-2true, 293#true]) [2025-03-08 22:02:32,200 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 12#L722-3true, 276#true, 274#true, 293#true, 119#L715-9true]) [2025-03-08 22:02:32,200 INFO L294 olderBase$Statistics]: this new event has 240 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 12#L722-3true, 276#true, 274#true, 191#L715-8true, 293#true]) [2025-03-08 22:02:32,200 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-08 22:02:32,200 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-03-08 22:02:32,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] 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][175], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 32#L715-8true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 263#L715-2true, 293#true]) [2025-03-08 22:02:32,471 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2025-03-08 22:02:32,471 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-08 22:02:32,471 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-08 22:02:32,471 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-08 22:02:32,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 293#true, 119#L715-9true]) [2025-03-08 22:02:32,471 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-08 22:02:32,472 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-08 22:02:32,472 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2025-03-08 22:02:32,472 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-08 22:02:32,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1102] 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][239], [Black: 284#true, 289#true, 271#true, Black: 291#(= |ULTIMATE.start_main_~i~1#1| 0), 165#L715-2true, 276#true, 274#true, 206#ULTIMATE.startFINALtrue, 191#L715-8true, 293#true]) [2025-03-08 22:02:32,472 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2025-03-08 22:02:32,472 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-08 22:02:32,472 INFO L297 olderBase$Statistics]: existing Event has 193 ancestors and is cut-off event [2025-03-08 22:02:32,472 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-08 22:02:32,582 INFO L124 PetriNetUnfolderBase]: 17529/82841 cut-off events. [2025-03-08 22:02:32,582 INFO L125 PetriNetUnfolderBase]: For 2151/2225 co-relation queries the response was YES. [2025-03-08 22:02:32,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110660 conditions, 82841 events. 17529/82841 cut-off events. For 2151/2225 co-relation queries the response was YES. Maximal size of possible extension queue 1343. Compared 1248128 event pairs, 6187 based on Foata normal form. 5/74928 useless extension candidates. Maximal degree in co-relation 82599. Up to 20381 conditions per place. [2025-03-08 22:02:33,049 INFO L140 encePairwiseOnDemand]: 286/291 looper letters, 52 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2025-03-08 22:02:33,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 297 transitions, 789 flow [2025-03-08 22:02:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:33,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1486 transitions. [2025-03-08 22:02:33,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8510882016036655 [2025-03-08 22:02:33,052 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 625 flow. Second operand 6 states and 1486 transitions. [2025-03-08 22:02:33,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 297 transitions, 789 flow [2025-03-08 22:02:33,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 297 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:33,057 INFO L231 Difference]: Finished difference. Result has 278 places, 276 transitions, 655 flow [2025-03-08 22:02:33,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=655, PETRI_PLACES=278, PETRI_TRANSITIONS=276} [2025-03-08 22:02:33,057 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 3 predicate places. [2025-03-08 22:02:33,058 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 276 transitions, 655 flow [2025-03-08 22:02:33,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 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-08 22:02:33,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:33,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:02:33,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:02:33,059 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-08 22:02:33,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2100243488, now seen corresponding path program 1 times [2025-03-08 22:02:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:33,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854689253] [2025-03-08 22:02:33,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:33,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 22:02:33,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 22:02:33,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:33,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:33,274 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-08 22:02:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854689253] [2025-03-08 22:02:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854689253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:33,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:33,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007124369] [2025-03-08 22:02:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:33,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:33,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:33,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:33,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:33,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 291 [2025-03-08 22:02:33,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 276 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-08 22:02:33,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:33,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 291 [2025-03-08 22:02:33,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand