./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/pthread-race-challenges/per-thread-array-join-counter-race-2.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 534bdd637f5e5b671357d3ac8ec1b617321ae1d1d7a44132336275a64f61ed0f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:41:55,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:41:55,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:41:55,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:41:55,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:41:55,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:41:55,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:41:55,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:41:55,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:41:55,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:41:55,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:41:55,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:41:55,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:41:55,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:41:55,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:41:55,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:41:55,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:41:55,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:41:55,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:41:55,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:41:55,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:41:55,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:41:55,296 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:41:55,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:41:55,296 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:41:55,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:41:55,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:41:55,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:41:55,297 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:41:55,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:41:55,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:41:55,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:41:55,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:41:55,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:41:55,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:41:55,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:41:55,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:41:55,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:41:55,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:41:55,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:41:55,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:41:55,301 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 534bdd637f5e5b671357d3ac8ec1b617321ae1d1d7a44132336275a64f61ed0f [2024-11-10 14:41:55,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:41:55,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:41:55,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:41:55,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:41:55,612 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:41:55,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i [2024-11-10 14:41:57,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:41:57,300 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:41:57,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i [2024-11-10 14:41:57,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58eb3eb74/63f8b9b6de8c4a4ab2f38ff708a4d38b/FLAGda4f98228 [2024-11-10 14:41:57,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58eb3eb74/63f8b9b6de8c4a4ab2f38ff708a4d38b [2024-11-10 14:41:57,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:41:57,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:41:57,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:41:57,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:41:57,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:41:57,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:41:57" (1/1) ... [2024-11-10 14:41:57,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a5935f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:57, skipping insertion in model container [2024-11-10 14:41:57,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:41:57" (1/1) ... [2024-11-10 14:41:57,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:41:57,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:41:57,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:41:57,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:41:58,049 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:41:58,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58 WrapperNode [2024-11-10 14:41:58,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:41:58,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:41:58,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:41:58,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:41:58,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,128 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2024-11-10 14:41:58,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:41:58,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:41:58,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:41:58,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:41:58,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:41:58,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:41:58,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:41:58,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:41:58,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (1/1) ... [2024-11-10 14:41:58,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:41:58,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:41:58,231 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) [2024-11-10 14:41:58,233 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 [2024-11-10 14:41:58,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:41:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:41:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:41:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:41:58,278 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:41:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:41:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:41:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-11-10 14:41:58,279 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-11-10 14:41:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:41:58,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:41:58,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:41:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:41:58,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:41:58,282 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:41:58,434 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:41:58,436 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:41:58,904 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:41:58,904 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:41:58,989 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:41:58,990 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:41:58,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:41:58 BoogieIcfgContainer [2024-11-10 14:41:58,990 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:41:58,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:41:58,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:41:59,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:41:59,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:41:57" (1/3) ... [2024-11-10 14:41:59,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12fd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:41:59, skipping insertion in model container [2024-11-10 14:41:59,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:58" (2/3) ... [2024-11-10 14:41:59,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12fd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:41:59, skipping insertion in model container [2024-11-10 14:41:59,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:41:58" (3/3) ... [2024-11-10 14:41:59,007 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-2.i [2024-11-10 14:41:59,041 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:41:59,041 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-10 14:41:59,041 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:41:59,156 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:41:59,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 464 places, 473 transitions, 960 flow [2024-11-10 14:41:59,447 INFO L124 PetriNetUnfolderBase]: 21/592 cut-off events. [2024-11-10 14:41:59,448 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:41:59,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 592 events. 21/592 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 997 event pairs, 0 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 380. Up to 6 conditions per place. [2024-11-10 14:41:59,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 464 places, 473 transitions, 960 flow [2024-11-10 14:41:59,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 393 places, 398 transitions, 806 flow [2024-11-10 14:41:59,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:41:59,499 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;@67f53d98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:41:59,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-11-10 14:41:59,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:41:59,540 INFO L124 PetriNetUnfolderBase]: 0/148 cut-off events. [2024-11-10 14:41:59,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:41:59,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:59,541 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:41:59,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:41:59,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1098479836, now seen corresponding path program 1 times [2024-11-10 14:41:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97068217] [2024-11-10 14:41:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:59,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:00,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:00,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97068217] [2024-11-10 14:42:00,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97068217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:00,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:00,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:00,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969166413] [2024-11-10 14:42:00,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:00,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:00,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 473 [2024-11-10 14:42:00,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 398 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2024-11-10 14:42:00,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:00,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 473 [2024-11-10 14:42:00,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:01,198 INFO L124 PetriNetUnfolderBase]: 617/3927 cut-off events. [2024-11-10 14:42:01,198 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-10 14:42:01,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 3927 events. 617/3927 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 29848 event pairs, 482 based on Foata normal form. 180/3508 useless extension candidates. Maximal degree in co-relation 4710. Up to 985 conditions per place. [2024-11-10 14:42:01,235 INFO L140 encePairwiseOnDemand]: 463/473 looper letters, 28 selfloop transitions, 2 changer transitions 1/388 dead transitions. [2024-11-10 14:42:01,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 388 transitions, 846 flow [2024-11-10 14:42:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1316 transitions. [2024-11-10 14:42:01,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9274136715997181 [2024-11-10 14:42:01,261 INFO L175 Difference]: Start difference. First operand has 393 places, 398 transitions, 806 flow. Second operand 3 states and 1316 transitions. [2024-11-10 14:42:01,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 388 transitions, 846 flow [2024-11-10 14:42:01,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 388 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:01,278 INFO L231 Difference]: Finished difference. Result has 390 places, 387 transitions, 787 flow [2024-11-10 14:42:01,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=390, PETRI_TRANSITIONS=387} [2024-11-10 14:42:01,287 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -3 predicate places. [2024-11-10 14:42:01,287 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 387 transitions, 787 flow [2024-11-10 14:42:01,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2024-11-10 14:42:01,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:01,288 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:01,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:42:01,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:01,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2093176958, now seen corresponding path program 1 times [2024-11-10 14:42:01,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:01,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267682052] [2024-11-10 14:42:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:01,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:01,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267682052] [2024-11-10 14:42:01,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267682052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:01,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:01,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:01,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083545055] [2024-11-10 14:42:01,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:01,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:01,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:01,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:01,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 473 [2024-11-10 14:42:01,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 387 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 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) [2024-11-10 14:42:01,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:01,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 473 [2024-11-10 14:42:01,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:02,549 INFO L124 PetriNetUnfolderBase]: 747/4761 cut-off events. [2024-11-10 14:42:02,550 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-10 14:42:02,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5948 conditions, 4761 events. 747/4761 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 38308 event pairs, 571 based on Foata normal form. 0/4034 useless extension candidates. Maximal degree in co-relation 5791. Up to 1153 conditions per place. [2024-11-10 14:42:02,586 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 31 selfloop transitions, 1 changer transitions 0/380 dead transitions. [2024-11-10 14:42:02,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 380 transitions, 837 flow [2024-11-10 14:42:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2024-11-10 14:42:02,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069767441860465 [2024-11-10 14:42:02,590 INFO L175 Difference]: Start difference. First operand has 390 places, 387 transitions, 787 flow. Second operand 3 states and 1287 transitions. [2024-11-10 14:42:02,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 380 transitions, 837 flow [2024-11-10 14:42:02,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 380 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:02,596 INFO L231 Difference]: Finished difference. Result has 382 places, 380 transitions, 771 flow [2024-11-10 14:42:02,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=382, PETRI_TRANSITIONS=380} [2024-11-10 14:42:02,598 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -11 predicate places. [2024-11-10 14:42:02,598 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 380 transitions, 771 flow [2024-11-10 14:42:02,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 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) [2024-11-10 14:42:02,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:02,600 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:02,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:42:02,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:02,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 105041768, now seen corresponding path program 1 times [2024-11-10 14:42:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:02,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996197804] [2024-11-10 14:42:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:02,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:02,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996197804] [2024-11-10 14:42:02,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996197804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:02,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:02,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:02,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129348256] [2024-11-10 14:42:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:02,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:02,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:02,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:02,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 473 [2024-11-10 14:42:02,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 380 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 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) [2024-11-10 14:42:02,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:02,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 473 [2024-11-10 14:42:02,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:03,658 INFO L124 PetriNetUnfolderBase]: 685/4219 cut-off events. [2024-11-10 14:42:03,659 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-10 14:42:03,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5341 conditions, 4219 events. 685/4219 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 33633 event pairs, 541 based on Foata normal form. 0/3595 useless extension candidates. Maximal degree in co-relation 5184. Up to 1090 conditions per place. [2024-11-10 14:42:03,706 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 24 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2024-11-10 14:42:03,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 379 transitions, 821 flow [2024-11-10 14:42:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1317 transitions. [2024-11-10 14:42:03,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9281183932346723 [2024-11-10 14:42:03,710 INFO L175 Difference]: Start difference. First operand has 382 places, 380 transitions, 771 flow. Second operand 3 states and 1317 transitions. [2024-11-10 14:42:03,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 379 transitions, 821 flow [2024-11-10 14:42:03,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 379 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:03,718 INFO L231 Difference]: Finished difference. Result has 382 places, 379 transitions, 772 flow [2024-11-10 14:42:03,719 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=382, PETRI_TRANSITIONS=379} [2024-11-10 14:42:03,719 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -11 predicate places. [2024-11-10 14:42:03,720 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 379 transitions, 772 flow [2024-11-10 14:42:03,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 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) [2024-11-10 14:42:03,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:03,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:03,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:42:03,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:03,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:03,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1853515082, now seen corresponding path program 1 times [2024-11-10 14:42:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610718750] [2024-11-10 14:42:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610718750] [2024-11-10 14:42:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610718750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:03,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:03,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559761510] [2024-11-10 14:42:03,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:03,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:03,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:03,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 473 [2024-11-10 14:42:03,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 379 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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) [2024-11-10 14:42:03,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:03,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 473 [2024-11-10 14:42:03,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:04,689 INFO L124 PetriNetUnfolderBase]: 835/4414 cut-off events. [2024-11-10 14:42:04,689 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-10 14:42:04,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5712 conditions, 4414 events. 835/4414 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 34101 event pairs, 605 based on Foata normal form. 0/3775 useless extension candidates. Maximal degree in co-relation 5555. Up to 1258 conditions per place. [2024-11-10 14:42:04,721 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 24 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-11-10 14:42:04,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 378 transitions, 822 flow [2024-11-10 14:42:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2024-11-10 14:42:04,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9260042283298098 [2024-11-10 14:42:04,725 INFO L175 Difference]: Start difference. First operand has 382 places, 379 transitions, 772 flow. Second operand 3 states and 1314 transitions. [2024-11-10 14:42:04,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 378 transitions, 822 flow [2024-11-10 14:42:04,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 378 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:04,731 INFO L231 Difference]: Finished difference. Result has 381 places, 378 transitions, 770 flow [2024-11-10 14:42:04,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=381, PETRI_TRANSITIONS=378} [2024-11-10 14:42:04,732 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -12 predicate places. [2024-11-10 14:42:04,732 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 378 transitions, 770 flow [2024-11-10 14:42:04,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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) [2024-11-10 14:42:04,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:04,734 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:04,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:42:04,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:04,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2051721540, now seen corresponding path program 1 times [2024-11-10 14:42:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506049329] [2024-11-10 14:42:04,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:04,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:04,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506049329] [2024-11-10 14:42:04,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506049329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:04,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:04,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:04,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181314305] [2024-11-10 14:42:04,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:04,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:04,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:04,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:04,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:04,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 473 [2024-11-10 14:42:04,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 378 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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) [2024-11-10 14:42:04,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:04,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 473 [2024-11-10 14:42:04,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:05,722 INFO L124 PetriNetUnfolderBase]: 991/4652 cut-off events. [2024-11-10 14:42:05,723 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-10 14:42:05,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6169 conditions, 4652 events. 991/4652 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 36678 event pairs, 713 based on Foata normal form. 0/3990 useless extension candidates. Maximal degree in co-relation 6012. Up to 1475 conditions per place. [2024-11-10 14:42:05,758 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 26 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-11-10 14:42:05,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 377 transitions, 824 flow [2024-11-10 14:42:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:05,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2024-11-10 14:42:05,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.923185341789993 [2024-11-10 14:42:05,762 INFO L175 Difference]: Start difference. First operand has 381 places, 378 transitions, 770 flow. Second operand 3 states and 1310 transitions. [2024-11-10 14:42:05,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 377 transitions, 824 flow [2024-11-10 14:42:05,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:05,769 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2024-11-10 14:42:05,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=380, PETRI_TRANSITIONS=377} [2024-11-10 14:42:05,771 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -13 predicate places. [2024-11-10 14:42:05,771 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2024-11-10 14:42:05,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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) [2024-11-10 14:42:05,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:05,772 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:05,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:42:05,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:05,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1630607585, now seen corresponding path program 1 times [2024-11-10 14:42:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830378115] [2024-11-10 14:42:05,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830378115] [2024-11-10 14:42:05,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830378115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:05,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:05,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905606362] [2024-11-10 14:42:05,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:05,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:05,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:05,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:05,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:05,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 473 [2024-11-10 14:42:05,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 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) [2024-11-10 14:42:05,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:05,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 473 [2024-11-10 14:42:05,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:06,746 INFO L124 PetriNetUnfolderBase]: 1451/5174 cut-off events. [2024-11-10 14:42:06,747 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-10 14:42:06,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7368 conditions, 5174 events. 1451/5174 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 39688 event pairs, 507 based on Foata normal form. 0/4598 useless extension candidates. Maximal degree in co-relation 7212. Up to 2100 conditions per place. [2024-11-10 14:42:06,787 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 38 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2024-11-10 14:42:06,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 385 transitions, 871 flow [2024-11-10 14:42:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2024-11-10 14:42:06,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9182522903453136 [2024-11-10 14:42:06,791 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1303 transitions. [2024-11-10 14:42:06,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 385 transitions, 871 flow [2024-11-10 14:42:06,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 385 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:06,799 INFO L231 Difference]: Finished difference. Result has 376 places, 375 transitions, 775 flow [2024-11-10 14:42:06,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=376, PETRI_TRANSITIONS=375} [2024-11-10 14:42:06,802 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -17 predicate places. [2024-11-10 14:42:06,802 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 375 transitions, 775 flow [2024-11-10 14:42:06,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 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) [2024-11-10 14:42:06,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:06,806 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:06,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:42:06,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:06,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:06,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1136606378, now seen corresponding path program 1 times [2024-11-10 14:42:06,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:06,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142645836] [2024-11-10 14:42:06,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:06,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:06,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:06,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142645836] [2024-11-10 14:42:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142645836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:06,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:06,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:06,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221673048] [2024-11-10 14:42:06,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:06,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:06,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:06,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:06,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:06,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2024-11-10 14:42:06,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 375 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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) [2024-11-10 14:42:06,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:06,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2024-11-10 14:42:06,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:07,741 INFO L124 PetriNetUnfolderBase]: 958/5613 cut-off events. [2024-11-10 14:42:07,742 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-10 14:42:07,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7294 conditions, 5613 events. 958/5613 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 48509 event pairs, 625 based on Foata normal form. 0/4986 useless extension candidates. Maximal degree in co-relation 7138. Up to 1485 conditions per place. [2024-11-10 14:42:07,791 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 30 selfloop transitions, 3 changer transitions 0/381 dead transitions. [2024-11-10 14:42:07,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 381 transitions, 853 flow [2024-11-10 14:42:07,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1320 transitions. [2024-11-10 14:42:07,796 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302325581395349 [2024-11-10 14:42:07,796 INFO L175 Difference]: Start difference. First operand has 376 places, 375 transitions, 775 flow. Second operand 3 states and 1320 transitions. [2024-11-10 14:42:07,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 381 transitions, 853 flow [2024-11-10 14:42:07,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:07,804 INFO L231 Difference]: Finished difference. Result has 376 places, 375 transitions, 790 flow [2024-11-10 14:42:07,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=376, PETRI_TRANSITIONS=375} [2024-11-10 14:42:07,806 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -17 predicate places. [2024-11-10 14:42:07,806 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 375 transitions, 790 flow [2024-11-10 14:42:07,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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) [2024-11-10 14:42:07,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:07,807 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:07,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:42:07,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:07,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1067374685, now seen corresponding path program 1 times [2024-11-10 14:42:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39566414] [2024-11-10 14:42:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:07,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:07,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39566414] [2024-11-10 14:42:07,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39566414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:07,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:07,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:07,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820281101] [2024-11-10 14:42:07,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:07,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:07,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:07,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:07,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:07,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 473 [2024-11-10 14:42:07,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 375 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2024-11-10 14:42:07,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:07,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 473 [2024-11-10 14:42:07,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:09,448 INFO L124 PetriNetUnfolderBase]: 1809/8763 cut-off events. [2024-11-10 14:42:09,449 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-10 14:42:09,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11842 conditions, 8763 events. 1809/8763 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 78674 event pairs, 655 based on Foata normal form. 0/7593 useless extension candidates. Maximal degree in co-relation 11685. Up to 1443 conditions per place. [2024-11-10 14:42:09,513 INFO L140 encePairwiseOnDemand]: 462/473 looper letters, 44 selfloop transitions, 8 changer transitions 0/399 dead transitions. [2024-11-10 14:42:09,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 399 transitions, 948 flow [2024-11-10 14:42:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1333 transitions. [2024-11-10 14:42:09,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2024-11-10 14:42:09,517 INFO L175 Difference]: Start difference. First operand has 376 places, 375 transitions, 790 flow. Second operand 3 states and 1333 transitions. [2024-11-10 14:42:09,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 399 transitions, 948 flow [2024-11-10 14:42:09,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 399 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:09,526 INFO L231 Difference]: Finished difference. Result has 380 places, 383 transitions, 860 flow [2024-11-10 14:42:09,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=380, PETRI_TRANSITIONS=383} [2024-11-10 14:42:09,528 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -13 predicate places. [2024-11-10 14:42:09,529 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 383 transitions, 860 flow [2024-11-10 14:42:09,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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) [2024-11-10 14:42:09,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:09,531 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:09,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:42:09,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:09,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash -163307582, now seen corresponding path program 1 times [2024-11-10 14:42:09,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:09,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42132896] [2024-11-10 14:42:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:09,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:09,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42132896] [2024-11-10 14:42:09,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42132896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:09,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:09,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480759611] [2024-11-10 14:42:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:09,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:09,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:09,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:09,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:09,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 473 [2024-11-10 14:42:09,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 383 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 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) [2024-11-10 14:42:09,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:09,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 473 [2024-11-10 14:42:09,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:11,361 INFO L124 PetriNetUnfolderBase]: 2111/10828 cut-off events. [2024-11-10 14:42:11,361 INFO L125 PetriNetUnfolderBase]: For 155/163 co-relation queries the response was YES. [2024-11-10 14:42:11,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14645 conditions, 10828 events. 2111/10828 cut-off events. For 155/163 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 103677 event pairs, 1244 based on Foata normal form. 0/9728 useless extension candidates. Maximal degree in co-relation 14486. Up to 2835 conditions per place. [2024-11-10 14:42:11,451 INFO L140 encePairwiseOnDemand]: 468/473 looper letters, 35 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-11-10 14:42:11,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 393 transitions, 957 flow [2024-11-10 14:42:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1315 transitions. [2024-11-10 14:42:11,455 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9267089499647639 [2024-11-10 14:42:11,455 INFO L175 Difference]: Start difference. First operand has 380 places, 383 transitions, 860 flow. Second operand 3 states and 1315 transitions. [2024-11-10 14:42:11,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 393 transitions, 957 flow [2024-11-10 14:42:11,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 393 transitions, 941 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:11,464 INFO L231 Difference]: Finished difference. Result has 378 places, 382 transitions, 852 flow [2024-11-10 14:42:11,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=378, PETRI_TRANSITIONS=382} [2024-11-10 14:42:11,466 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -15 predicate places. [2024-11-10 14:42:11,466 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 382 transitions, 852 flow [2024-11-10 14:42:11,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 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) [2024-11-10 14:42:11,467 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:11,467 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:11,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:42:11,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:11,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1102609131, now seen corresponding path program 1 times [2024-11-10 14:42:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:11,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110167293] [2024-11-10 14:42:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:11,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:11,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:11,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110167293] [2024-11-10 14:42:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110167293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:11,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:11,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972031176] [2024-11-10 14:42:11,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:11,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:11,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:11,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:11,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 473 [2024-11-10 14:42:11,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 382 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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) [2024-11-10 14:42:11,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:11,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 473 [2024-11-10 14:42:11,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:15,083 INFO L124 PetriNetUnfolderBase]: 4584/20562 cut-off events. [2024-11-10 14:42:15,084 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-10 14:42:15,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29288 conditions, 20562 events. 4584/20562 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 221434 event pairs, 2480 based on Foata normal form. 0/18614 useless extension candidates. Maximal degree in co-relation 29128. Up to 5342 conditions per place. [2024-11-10 14:42:15,174 INFO L140 encePairwiseOnDemand]: 463/473 looper letters, 45 selfloop transitions, 9 changer transitions 0/405 dead transitions. [2024-11-10 14:42:15,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 405 transitions, 1012 flow [2024-11-10 14:42:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1333 transitions. [2024-11-10 14:42:15,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2024-11-10 14:42:15,178 INFO L175 Difference]: Start difference. First operand has 378 places, 382 transitions, 852 flow. Second operand 3 states and 1333 transitions. [2024-11-10 14:42:15,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 405 transitions, 1012 flow [2024-11-10 14:42:15,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 405 transitions, 1012 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:15,185 INFO L231 Difference]: Finished difference. Result has 382 places, 390 transitions, 922 flow [2024-11-10 14:42:15,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=382, PETRI_TRANSITIONS=390} [2024-11-10 14:42:15,186 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -11 predicate places. [2024-11-10 14:42:15,187 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 390 transitions, 922 flow [2024-11-10 14:42:15,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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) [2024-11-10 14:42:15,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:15,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:15,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:42:15,188 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:15,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:15,188 INFO L85 PathProgramCache]: Analyzing trace with hash -692849142, now seen corresponding path program 1 times [2024-11-10 14:42:15,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:15,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975847265] [2024-11-10 14:42:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:15,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:15,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:15,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975847265] [2024-11-10 14:42:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975847265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:15,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:15,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:15,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952642526] [2024-11-10 14:42:15,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:42:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:15,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:42:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:42:15,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 473 [2024-11-10 14:42:15,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 390 transitions, 922 flow. Second operand has 5 states, 5 states have (on average 430.8) internal successors, (2154), 5 states have internal predecessors, (2154), 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) [2024-11-10 14:42:15,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:15,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 473 [2024-11-10 14:42:15,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:18,098 INFO L124 PetriNetUnfolderBase]: 2538/15468 cut-off events. [2024-11-10 14:42:18,098 INFO L125 PetriNetUnfolderBase]: For 497/561 co-relation queries the response was YES. [2024-11-10 14:42:18,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21792 conditions, 15468 events. 2538/15468 cut-off events. For 497/561 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 167713 event pairs, 1887 based on Foata normal form. 4/14038 useless extension candidates. Maximal degree in co-relation 21628. Up to 3397 conditions per place. [2024-11-10 14:42:18,169 INFO L140 encePairwiseOnDemand]: 464/473 looper letters, 36 selfloop transitions, 8 changer transitions 0/404 dead transitions. [2024-11-10 14:42:18,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 404 transitions, 1037 flow [2024-11-10 14:42:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2619 transitions. [2024-11-10 14:42:18,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228329809725159 [2024-11-10 14:42:18,178 INFO L175 Difference]: Start difference. First operand has 382 places, 390 transitions, 922 flow. Second operand 6 states and 2619 transitions. [2024-11-10 14:42:18,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 404 transitions, 1037 flow [2024-11-10 14:42:18,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 404 transitions, 1019 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:42:18,188 INFO L231 Difference]: Finished difference. Result has 389 places, 394 transitions, 949 flow [2024-11-10 14:42:18,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=389, PETRI_TRANSITIONS=394} [2024-11-10 14:42:18,190 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -4 predicate places. [2024-11-10 14:42:18,190 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 394 transitions, 949 flow [2024-11-10 14:42:18,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 430.8) internal successors, (2154), 5 states have internal predecessors, (2154), 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) [2024-11-10 14:42:18,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:18,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:18,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:42:18,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:18,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1296751241, now seen corresponding path program 1 times [2024-11-10 14:42:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:18,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727411958] [2024-11-10 14:42:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727411958] [2024-11-10 14:42:18,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727411958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:18,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:18,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:42:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818690139] [2024-11-10 14:42:18,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:18,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:18,414 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 436 out of 473 [2024-11-10 14:42:18,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 394 transitions, 949 flow. Second operand has 3 states, 3 states have (on average 437.6666666666667) internal successors, (1313), 3 states have internal predecessors, (1313), 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) [2024-11-10 14:42:18,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:18,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 436 of 473 [2024-11-10 14:42:18,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:21,149 INFO L124 PetriNetUnfolderBase]: 3173/17044 cut-off events. [2024-11-10 14:42:21,149 INFO L125 PetriNetUnfolderBase]: For 203/218 co-relation queries the response was YES. [2024-11-10 14:42:21,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24218 conditions, 17044 events. 3173/17044 cut-off events. For 203/218 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 185961 event pairs, 1565 based on Foata normal form. 8/15248 useless extension candidates. Maximal degree in co-relation 24049. Up to 3710 conditions per place. [2024-11-10 14:42:21,364 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 33 selfloop transitions, 3 changer transitions 0/408 dead transitions. [2024-11-10 14:42:21,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 408 transitions, 1052 flow [2024-11-10 14:42:21,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:42:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:42:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2024-11-10 14:42:21,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478505990133897 [2024-11-10 14:42:21,368 INFO L175 Difference]: Start difference. First operand has 389 places, 394 transitions, 949 flow. Second operand 3 states and 1345 transitions. [2024-11-10 14:42:21,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 408 transitions, 1052 flow [2024-11-10 14:42:21,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 408 transitions, 1048 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:21,378 INFO L231 Difference]: Finished difference. Result has 391 places, 395 transitions, 959 flow [2024-11-10 14:42:21,379 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=959, PETRI_PLACES=391, PETRI_TRANSITIONS=395} [2024-11-10 14:42:21,379 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -2 predicate places. [2024-11-10 14:42:21,379 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 395 transitions, 959 flow [2024-11-10 14:42:21,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 437.6666666666667) internal successors, (1313), 3 states have internal predecessors, (1313), 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) [2024-11-10 14:42:21,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:21,381 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:21,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:42:21,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 679753423, now seen corresponding path program 1 times [2024-11-10 14:42:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025985952] [2024-11-10 14:42:21,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:42:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:22,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025985952] [2024-11-10 14:42:22,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025985952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:22,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:22,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:22,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156494537] [2024-11-10 14:42:22,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:22,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:42:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:22,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:42:22,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:42:22,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 473 [2024-11-10 14:42:22,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 395 transitions, 959 flow. Second operand has 6 states, 6 states have (on average 414.8333333333333) internal successors, (2489), 6 states have internal predecessors, (2489), 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) [2024-11-10 14:42:22,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:22,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 473 [2024-11-10 14:42:22,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:28,012 INFO L124 PetriNetUnfolderBase]: 9893/34076 cut-off events. [2024-11-10 14:42:28,013 INFO L125 PetriNetUnfolderBase]: For 2755/2881 co-relation queries the response was YES. [2024-11-10 14:42:28,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57176 conditions, 34076 events. 9893/34076 cut-off events. For 2755/2881 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 379632 event pairs, 4759 based on Foata normal form. 4/31089 useless extension candidates. Maximal degree in co-relation 57005. Up to 11658 conditions per place. [2024-11-10 14:42:28,246 INFO L140 encePairwiseOnDemand]: 459/473 looper letters, 97 selfloop transitions, 46 changer transitions 0/491 dead transitions. [2024-11-10 14:42:28,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 491 transitions, 1519 flow [2024-11-10 14:42:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2603 transitions. [2024-11-10 14:42:28,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9171952078928823 [2024-11-10 14:42:28,251 INFO L175 Difference]: Start difference. First operand has 391 places, 395 transitions, 959 flow. Second operand 6 states and 2603 transitions. [2024-11-10 14:42:28,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 491 transitions, 1519 flow [2024-11-10 14:42:28,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 491 transitions, 1516 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:28,262 INFO L231 Difference]: Finished difference. Result has 399 places, 440 transitions, 1291 flow [2024-11-10 14:42:28,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1291, PETRI_PLACES=399, PETRI_TRANSITIONS=440} [2024-11-10 14:42:28,264 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, 6 predicate places. [2024-11-10 14:42:28,264 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 440 transitions, 1291 flow [2024-11-10 14:42:28,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 414.8333333333333) internal successors, (2489), 6 states have internal predecessors, (2489), 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) [2024-11-10 14:42:28,266 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:28,266 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:28,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:42:28,266 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:28,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1076608011, now seen corresponding path program 1 times [2024-11-10 14:42:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023487394] [2024-11-10 14:42:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:28,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:28,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:28,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023487394] [2024-11-10 14:42:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023487394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:28,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:42:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045997398] [2024-11-10 14:42:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:28,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:42:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:28,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:42:28,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:42:28,553 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 473 [2024-11-10 14:42:28,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 440 transitions, 1291 flow. Second operand has 5 states, 5 states have (on average 431.0) internal successors, (2155), 5 states have internal predecessors, (2155), 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) [2024-11-10 14:42:28,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:28,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 473 [2024-11-10 14:42:28,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:32,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([967] threadEXIT-->L1043: Formula: (= v_threadThread1of1ForFork1_thidvar0_6 |v_cleanerThread1of1ForFork0_#t~mem12_8|) InVars {cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} OutVars{cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} AuxVars[] AssignedVars[][403], [Black: 507#(<= ~threads_total~0 0), Black: 510#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 508#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 529#true, 462#true, Black: 482#true, Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), 465#true, 290#L1070true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 492#(= |#race~threads_alive~0| 0), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 497#(= |#race~flags~0| 0), Black: 495#true, 488#(= |#race~tids~0| 0), 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 472#(= |#race~threads_total~0| 0), 244#L1043true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:32,874 INFO L294 olderBase$Statistics]: this new event has 414 ancestors and is cut-off event [2024-11-10 14:42:32,875 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-10 14:42:32,875 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-10 14:42:32,875 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-10 14:42:32,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([967] threadEXIT-->L1043: Formula: (= v_threadThread1of1ForFork1_thidvar0_6 |v_cleanerThread1of1ForFork0_#t~mem12_8|) InVars {cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} OutVars{cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} AuxVars[] AssignedVars[][403], [Black: 507#(<= ~threads_total~0 0), Black: 510#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 508#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 529#true, 462#true, 407#L1072true, Black: 482#true, Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 492#(= |#race~threads_alive~0| 0), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 497#(= |#race~flags~0| 0), Black: 495#true, 488#(= |#race~tids~0| 0), 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 472#(= |#race~threads_total~0| 0), 244#L1043true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:32,974 INFO L294 olderBase$Statistics]: this new event has 423 ancestors and is cut-off event [2024-11-10 14:42:32,974 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-10 14:42:32,974 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-10 14:42:32,974 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-10 14:42:32,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([967] threadEXIT-->L1043: Formula: (= v_threadThread1of1ForFork1_thidvar0_6 |v_cleanerThread1of1ForFork0_#t~mem12_8|) InVars {cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} OutVars{cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} AuxVars[] AssignedVars[][403], [Black: 507#(<= ~threads_total~0 0), Black: 510#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 508#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 529#true, 462#true, Black: 482#true, Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 490#true, Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 497#(= |#race~flags~0| 0), 17#L1074-2true, Black: 495#true, 488#(= |#race~tids~0| 0), 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 472#(= |#race~threads_total~0| 0), 244#L1043true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:32,999 INFO L294 olderBase$Statistics]: this new event has 428 ancestors and is cut-off event [2024-11-10 14:42:32,999 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2024-11-10 14:42:32,999 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2024-11-10 14:42:32,999 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2024-11-10 14:42:33,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([967] threadEXIT-->L1043: Formula: (= v_threadThread1of1ForFork1_thidvar0_6 |v_cleanerThread1of1ForFork0_#t~mem12_8|) InVars {cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} OutVars{cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} AuxVars[] AssignedVars[][403], [Black: 507#(<= ~threads_total~0 0), Black: 510#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 508#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 322#L1075true, 529#true, 462#true, Black: 482#true, Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 490#true, Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 497#(= |#race~flags~0| 0), Black: 495#true, 488#(= |#race~tids~0| 0), 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 472#(= |#race~threads_total~0| 0), 244#L1043true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:33,001 INFO L294 olderBase$Statistics]: this new event has 428 ancestors and is cut-off event [2024-11-10 14:42:33,002 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2024-11-10 14:42:33,002 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2024-11-10 14:42:33,002 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2024-11-10 14:42:33,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([967] threadEXIT-->L1043: Formula: (= v_threadThread1of1ForFork1_thidvar0_6 |v_cleanerThread1of1ForFork0_#t~mem12_8|) InVars {cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} OutVars{cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} AuxVars[] AssignedVars[][403], [Black: 507#(<= ~threads_total~0 0), Black: 510#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 508#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 529#true, 462#true, Black: 482#true, 376#L1073true, Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 490#true, Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 497#(= |#race~flags~0| 0), Black: 495#true, 488#(= |#race~tids~0| 0), 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 472#(= |#race~threads_total~0| 0), 244#L1043true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:33,003 INFO L294 olderBase$Statistics]: this new event has 429 ancestors and is cut-off event [2024-11-10 14:42:33,003 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2024-11-10 14:42:33,003 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2024-11-10 14:42:33,003 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2024-11-10 14:42:33,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([967] threadEXIT-->L1043: Formula: (= v_threadThread1of1ForFork1_thidvar0_6 |v_cleanerThread1of1ForFork0_#t~mem12_8|) InVars {cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} OutVars{cleanerThread1of1ForFork0_#t~mem12=|v_cleanerThread1of1ForFork0_#t~mem12_8|, threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6} AuxVars[] AssignedVars[][403], [Black: 507#(<= ~threads_total~0 0), Black: 510#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 508#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 529#true, 462#true, Black: 482#true, Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 490#true, Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 497#(= |#race~flags~0| 0), Black: 495#true, 488#(= |#race~tids~0| 0), 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 180#ULTIMATE.startFINALtrue, 472#(= |#race~threads_total~0| 0), 244#L1043true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:33,037 INFO L294 olderBase$Statistics]: this new event has 437 ancestors and is cut-off event [2024-11-10 14:42:33,037 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-10 14:42:33,037 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-10 14:42:33,037 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-10 14:42:33,056 INFO L124 PetriNetUnfolderBase]: 5166/26777 cut-off events. [2024-11-10 14:42:33,057 INFO L125 PetriNetUnfolderBase]: For 2626/3952 co-relation queries the response was YES. [2024-11-10 14:42:33,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42071 conditions, 26777 events. 5166/26777 cut-off events. For 2626/3952 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 315333 event pairs, 2861 based on Foata normal form. 15/24449 useless extension candidates. Maximal degree in co-relation 41895. Up to 6380 conditions per place. [2024-11-10 14:42:33,296 INFO L140 encePairwiseOnDemand]: 464/473 looper letters, 27 selfloop transitions, 4 changer transitions 13/448 dead transitions. [2024-11-10 14:42:33,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 448 transitions, 1390 flow [2024-11-10 14:42:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2616 transitions. [2024-11-10 14:42:33,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9217758985200846 [2024-11-10 14:42:33,303 INFO L175 Difference]: Start difference. First operand has 399 places, 440 transitions, 1291 flow. Second operand 6 states and 2616 transitions. [2024-11-10 14:42:33,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 448 transitions, 1390 flow [2024-11-10 14:42:33,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 448 transitions, 1390 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:33,321 INFO L231 Difference]: Finished difference. Result has 406 places, 435 transitions, 1278 flow [2024-11-10 14:42:33,322 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1278, PETRI_PLACES=406, PETRI_TRANSITIONS=435} [2024-11-10 14:42:33,322 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, 13 predicate places. [2024-11-10 14:42:33,323 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 435 transitions, 1278 flow [2024-11-10 14:42:33,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 431.0) internal successors, (2155), 5 states have internal predecessors, (2155), 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) [2024-11-10 14:42:33,324 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:33,325 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:33,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:42:33,325 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:33,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:33,325 INFO L85 PathProgramCache]: Analyzing trace with hash -791670576, now seen corresponding path program 1 times [2024-11-10 14:42:33,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:33,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430475123] [2024-11-10 14:42:33,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:33,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:42:33,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:33,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430475123] [2024-11-10 14:42:33,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430475123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:33,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:33,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:42:33,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437456233] [2024-11-10 14:42:33,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:33,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:42:33,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:33,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:42:33,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:42:33,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 473 [2024-11-10 14:42:33,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 435 transitions, 1278 flow. Second operand has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 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) [2024-11-10 14:42:33,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:33,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 473 [2024-11-10 14:42:33,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:40,535 INFO L124 PetriNetUnfolderBase]: 9622/38817 cut-off events. [2024-11-10 14:42:40,537 INFO L125 PetriNetUnfolderBase]: For 4705/6464 co-relation queries the response was YES. [2024-11-10 14:42:40,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66135 conditions, 38817 events. 9622/38817 cut-off events. For 4705/6464 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 466202 event pairs, 4646 based on Foata normal form. 187/35371 useless extension candidates. Maximal degree in co-relation 65954. Up to 10891 conditions per place. [2024-11-10 14:42:40,823 INFO L140 encePairwiseOnDemand]: 461/473 looper letters, 64 selfloop transitions, 14 changer transitions 5/480 dead transitions. [2024-11-10 14:42:40,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 480 transitions, 1545 flow [2024-11-10 14:42:40,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:42:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 14:42:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4304 transitions. [2024-11-10 14:42:40,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9099365750528541 [2024-11-10 14:42:40,831 INFO L175 Difference]: Start difference. First operand has 406 places, 435 transitions, 1278 flow. Second operand 10 states and 4304 transitions. [2024-11-10 14:42:40,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 480 transitions, 1545 flow [2024-11-10 14:42:40,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 480 transitions, 1513 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-10 14:42:40,875 INFO L231 Difference]: Finished difference. Result has 406 places, 443 transitions, 1322 flow [2024-11-10 14:42:40,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1245, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1322, PETRI_PLACES=406, PETRI_TRANSITIONS=443} [2024-11-10 14:42:40,876 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, 13 predicate places. [2024-11-10 14:42:40,876 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 443 transitions, 1322 flow [2024-11-10 14:42:40,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 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) [2024-11-10 14:42:40,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:40,878 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:40,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:42:40,878 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-10 14:42:40,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2114713789, now seen corresponding path program 1 times [2024-11-10 14:42:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:40,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699294232] [2024-11-10 14:42:40,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:40,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:42:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699294232] [2024-11-10 14:42:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699294232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:40,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:42:40,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:42:40,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766904697] [2024-11-10 14:42:40,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:40,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:42:40,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:40,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:42:40,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:42:40,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 473 [2024-11-10 14:42:40,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 443 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 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) [2024-11-10 14:42:40,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:40,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 473 [2024-11-10 14:42:40,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:42,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][357], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 486#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 100#L1040-2true, 484#(= |#race~flags_mutex~0| 0), 465#true, 438#L1034-1true, Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,390 INFO L294 olderBase$Statistics]: this new event has 305 ancestors and is cut-off event [2024-11-10 14:42:42,391 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-10 14:42:42,391 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-10 14:42:42,391 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-10 14:42:42,421 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][357], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 438#L1034-1true, 100#L1040-2true, 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), 146#L1066-3true, Black: 495#true, 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 538#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,421 INFO L294 olderBase$Statistics]: this new event has 305 ancestors and is not cut-off event [2024-11-10 14:42:42,421 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is not cut-off event [2024-11-10 14:42:42,422 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is not cut-off event [2024-11-10 14:42:42,422 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is not cut-off event [2024-11-10 14:42:42,422 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is not cut-off event [2024-11-10 14:42:42,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, 316#L1066-6true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 486#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 484#(= |#race~flags_mutex~0| 0), Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 438#L1034-1true, 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,766 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-10 14:42:42,766 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-10 14:42:42,766 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-10 14:42:42,766 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-10 14:42:42,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 555#true, Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 484#(= |#race~flags_mutex~0| 0), 438#L1034-1true, 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,779 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-10 14:42:42,779 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,779 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,779 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, 316#L1066-6true, 29#L1043-4true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 486#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 484#(= |#race~flags_mutex~0| 0), Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 438#L1034-1true, 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,780 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-10 14:42:42,780 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,781 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,781 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,783 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, 316#L1066-6true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 486#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 438#L1034-1true, Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 538#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,783 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-10 14:42:42,783 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-10 14:42:42,783 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-10 14:42:42,784 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-10 14:42:42,784 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-10 14:42:42,805 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 296#L1066-4true, 463#true, Black: 482#true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 555#true, Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,805 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-10 14:42:42,806 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,806 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,806 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 555#true, Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, 438#L1034-1true, Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 538#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,807 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-10 14:42:42,807 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,807 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,807 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,809 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 486#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 538#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,809 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-10 14:42:42,809 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,809 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,809 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,809 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-10 14:42:42,812 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, 316#L1066-6true, 29#L1043-4true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 486#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 438#L1034-1true, Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,812 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-10 14:42:42,812 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-10 14:42:42,812 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,813 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,813 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-10 14:42:42,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 296#L1066-4true, 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 555#true, Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,836 INFO L294 olderBase$Statistics]: this new event has 324 ancestors and is cut-off event [2024-11-10 14:42:42,837 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-10 14:42:42,837 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-10 14:42:42,837 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-10 14:42:42,839 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 296#L1066-4true, 463#true, Black: 482#true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 486#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 484#(= |#race~flags_mutex~0| 0), 438#L1034-1true, 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,839 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-10 14:42:42,839 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,839 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-10 14:42:42,840 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,840 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,840 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 486#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 484#(= |#race~flags_mutex~0| 0), 465#true, 438#L1034-1true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,841 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-10 14:42:42,841 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-10 14:42:42,841 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,841 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,841 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-10 14:42:42,868 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][356], [Black: 517#(<= (+ ~threads_alive~0 1) 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 521#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 296#L1066-4true, 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 544#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 555#true, Black: 486#true, Black: 542#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 550#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 484#(= |#race~flags_mutex~0| 0), 438#L1034-1true, 465#true, Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 519#true, 538#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-10 14:42:42,868 INFO L294 olderBase$Statistics]: this new event has 324 ancestors and is cut-off event [2024-11-10 14:42:42,868 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-10 14:42:42,869 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-10 14:42:42,869 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-10 14:42:42,869 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event