./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-dev-4a390ef-m [2024-10-24 15:36:12,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:36:12,669 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:36:12,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:36:12,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:36:12,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:36:12,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:36:12,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:36:12,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:36:12,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:36:12,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:36:12,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:36:12,699 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:36:12,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:36:12,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:36:12,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:36:12,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:36:12,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:36:12,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:36:12,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:36:12,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:36:12,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:36:12,702 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:36:12,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:36:12,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:36:12,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:36:12,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:36:12,703 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:36:12,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:36:12,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:36:12,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:36:12,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:36:12,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:36:12,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:36:12,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:36:12,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:36:12,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:36:12,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:36:12,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:36:12,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:36:12,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:36:12,714 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-10-24 15:36:12,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:36:12,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:36:12,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:36:12,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:36:12,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:36:12,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i [2024-10-24 15:36:14,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:36:14,398 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:36:14,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-2.i [2024-10-24 15:36:14,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8e0e362/b9cbc4fb7806401d986c3a74b093a9ec/FLAGfa1f6be05 [2024-10-24 15:36:14,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8e0e362/b9cbc4fb7806401d986c3a74b093a9ec [2024-10-24 15:36:14,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:36:14,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:36:14,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:36:14,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:36:14,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:36:14,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad98db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14, skipping insertion in model container [2024-10-24 15:36:14,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:36:14,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:36:14,818 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:36:14,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:36:14,909 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:36:14,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14 WrapperNode [2024-10-24 15:36:14,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:36:14,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:36:14,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:36:14,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:36:14,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,952 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 173 [2024-10-24 15:36:14,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:36:14,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:36:14,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:36:14,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:36:14,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:36:14,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:36:14,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:36:14,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:36:14,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (1/1) ... [2024-10-24 15:36:14,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:36:15,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:36:15,024 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-10-24 15:36:15,034 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-10-24 15:36:15,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:36:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 15:36:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-24 15:36:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-24 15:36:15,068 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 15:36:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:36:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:36:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-10-24 15:36:15,069 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-10-24 15:36:15,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:36:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-24 15:36:15,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-24 15:36:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:36:15,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:36:15,071 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:36:15,206 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:36:15,209 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:36:15,606 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:36:15,606 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:36:15,643 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:36:15,643 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-24 15:36:15,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:36:15 BoogieIcfgContainer [2024-10-24 15:36:15,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:36:15,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:36:15,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:36:15,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:36:15,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:36:14" (1/3) ... [2024-10-24 15:36:15,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0edc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:36:15, skipping insertion in model container [2024-10-24 15:36:15,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:36:14" (2/3) ... [2024-10-24 15:36:15,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0edc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:36:15, skipping insertion in model container [2024-10-24 15:36:15,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:36:15" (3/3) ... [2024-10-24 15:36:15,653 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-2.i [2024-10-24 15:36:15,665 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:36:15,665 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-24 15:36:15,666 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:36:15,776 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-24 15:36:15,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 367 places, 376 transitions, 766 flow [2024-10-24 15:36:15,969 INFO L124 PetriNetUnfolderBase]: 21/495 cut-off events. [2024-10-24 15:36:15,969 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 15:36:15,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 495 events. 21/495 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 926 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 378. Up to 6 conditions per place. [2024-10-24 15:36:15,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 367 places, 376 transitions, 766 flow [2024-10-24 15:36:15,993 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 302 transitions, 614 flow [2024-10-24 15:36:16,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:36:16,009 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;@dff361d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:36:16,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-10-24 15:36:16,017 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:36:16,017 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2024-10-24 15:36:16,017 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:36:16,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:16,018 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] [2024-10-24 15:36:16,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1237391255, now seen corresponding path program 1 times [2024-10-24 15:36:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:16,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310289144] [2024-10-24 15:36:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:16,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:16,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310289144] [2024-10-24 15:36:16,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310289144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:16,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313523123] [2024-10-24 15:36:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:16,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:16,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:16,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:16,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:16,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 376 [2024-10-24 15:36:16,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 302 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-10-24 15:36:16,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:16,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 376 [2024-10-24 15:36:16,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:17,066 INFO L124 PetriNetUnfolderBase]: 654/4202 cut-off events. [2024-10-24 15:36:17,066 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-24 15:36:17,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5238 conditions, 4202 events. 654/4202 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 33301 event pairs, 489 based on Foata normal form. 182/3697 useless extension candidates. Maximal degree in co-relation 5101. Up to 1006 conditions per place. [2024-10-24 15:36:17,098 INFO L140 encePairwiseOnDemand]: 366/376 looper letters, 28 selfloop transitions, 2 changer transitions 1/292 dead transitions. [2024-10-24 15:36:17,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 292 transitions, 654 flow [2024-10-24 15:36:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1025 transitions. [2024-10-24 15:36:17,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9086879432624113 [2024-10-24 15:36:17,120 INFO L175 Difference]: Start difference. First operand has 297 places, 302 transitions, 614 flow. Second operand 3 states and 1025 transitions. [2024-10-24 15:36:17,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 292 transitions, 654 flow [2024-10-24 15:36:17,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 292 transitions, 653 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:36:17,131 INFO L231 Difference]: Finished difference. Result has 294 places, 291 transitions, 595 flow [2024-10-24 15:36:17,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=294, PETRI_TRANSITIONS=291} [2024-10-24 15:36:17,136 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -3 predicate places. [2024-10-24 15:36:17,137 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 291 transitions, 595 flow [2024-10-24 15:36:17,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-10-24 15:36:17,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:17,138 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] [2024-10-24 15:36:17,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:36:17,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:17,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash -824548405, now seen corresponding path program 1 times [2024-10-24 15:36:17,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21454612] [2024-10-24 15:36:17,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:17,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:17,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21454612] [2024-10-24 15:36:17,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21454612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:17,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:17,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257815254] [2024-10-24 15:36:17,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:17,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:17,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:17,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:17,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:17,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 376 [2024-10-24 15:36:17,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 291 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 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-10-24 15:36:17,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:17,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 376 [2024-10-24 15:36:17,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:17,841 INFO L124 PetriNetUnfolderBase]: 747/4645 cut-off events. [2024-10-24 15:36:17,841 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-24 15:36:17,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5832 conditions, 4645 events. 747/4645 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 37945 event pairs, 571 based on Foata normal form. 0/3925 useless extension candidates. Maximal degree in co-relation 5770. Up to 1153 conditions per place. [2024-10-24 15:36:17,865 INFO L140 encePairwiseOnDemand]: 368/376 looper letters, 31 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2024-10-24 15:36:17,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 645 flow [2024-10-24 15:36:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 996 transitions. [2024-10-24 15:36:17,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-10-24 15:36:17,869 INFO L175 Difference]: Start difference. First operand has 294 places, 291 transitions, 595 flow. Second operand 3 states and 996 transitions. [2024-10-24 15:36:17,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 645 flow [2024-10-24 15:36:17,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 284 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:36:17,875 INFO L231 Difference]: Finished difference. Result has 286 places, 284 transitions, 579 flow [2024-10-24 15:36:17,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=286, PETRI_TRANSITIONS=284} [2024-10-24 15:36:17,876 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -11 predicate places. [2024-10-24 15:36:17,876 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 284 transitions, 579 flow [2024-10-24 15:36:17,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 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-10-24 15:36:17,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:17,877 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] [2024-10-24 15:36:17,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:36:17,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:17,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1235349843, now seen corresponding path program 1 times [2024-10-24 15:36:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929405350] [2024-10-24 15:36:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:17,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929405350] [2024-10-24 15:36:17,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929405350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:17,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:17,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849487025] [2024-10-24 15:36:17,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:17,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:17,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:17,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:17,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 376 [2024-10-24 15:36:17,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 284 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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-10-24 15:36:17,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:17,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 376 [2024-10-24 15:36:17,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:18,396 INFO L124 PetriNetUnfolderBase]: 709/4432 cut-off events. [2024-10-24 15:36:18,396 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-10-24 15:36:18,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5566 conditions, 4432 events. 709/4432 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 36699 event pairs, 546 based on Foata normal form. 0/3756 useless extension candidates. Maximal degree in co-relation 5504. Up to 1102 conditions per place. [2024-10-24 15:36:18,422 INFO L140 encePairwiseOnDemand]: 373/376 looper letters, 24 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-10-24 15:36:18,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 283 transitions, 629 flow [2024-10-24 15:36:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1026 transitions. [2024-10-24 15:36:18,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9095744680851063 [2024-10-24 15:36:18,424 INFO L175 Difference]: Start difference. First operand has 286 places, 284 transitions, 579 flow. Second operand 3 states and 1026 transitions. [2024-10-24 15:36:18,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 283 transitions, 629 flow [2024-10-24 15:36:18,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 283 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:36:18,428 INFO L231 Difference]: Finished difference. Result has 286 places, 283 transitions, 580 flow [2024-10-24 15:36:18,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=286, PETRI_TRANSITIONS=283} [2024-10-24 15:36:18,429 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -11 predicate places. [2024-10-24 15:36:18,430 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 283 transitions, 580 flow [2024-10-24 15:36:18,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 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-10-24 15:36:18,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:18,430 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] [2024-10-24 15:36:18,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:36:18,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:18,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:18,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2001354401, now seen corresponding path program 1 times [2024-10-24 15:36:18,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:18,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656964954] [2024-10-24 15:36:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:18,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656964954] [2024-10-24 15:36:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656964954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:18,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:18,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13050907] [2024-10-24 15:36:18,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:18,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:18,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:18,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:18,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:18,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 376 [2024-10-24 15:36:18,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 283 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 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-10-24 15:36:18,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:18,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 376 [2024-10-24 15:36:18,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:19,055 INFO L124 PetriNetUnfolderBase]: 835/4303 cut-off events. [2024-10-24 15:36:19,056 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-24 15:36:19,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 4303 events. 835/4303 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 33885 event pairs, 605 based on Foata normal form. 0/3668 useless extension candidates. Maximal degree in co-relation 5539. Up to 1258 conditions per place. [2024-10-24 15:36:19,099 INFO L140 encePairwiseOnDemand]: 373/376 looper letters, 24 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-10-24 15:36:19,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 282 transitions, 630 flow [2024-10-24 15:36:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2024-10-24 15:36:19,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069148936170213 [2024-10-24 15:36:19,102 INFO L175 Difference]: Start difference. First operand has 286 places, 283 transitions, 580 flow. Second operand 3 states and 1023 transitions. [2024-10-24 15:36:19,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 282 transitions, 630 flow [2024-10-24 15:36:19,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 282 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:36:19,107 INFO L231 Difference]: Finished difference. Result has 285 places, 282 transitions, 578 flow [2024-10-24 15:36:19,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=285, PETRI_TRANSITIONS=282} [2024-10-24 15:36:19,108 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -12 predicate places. [2024-10-24 15:36:19,108 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 282 transitions, 578 flow [2024-10-24 15:36:19,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.3333333333333) internal successors, (1000), 3 states have internal predecessors, (1000), 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-10-24 15:36:19,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:19,109 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] [2024-10-24 15:36:19,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:36:19,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:19,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash -671291987, now seen corresponding path program 1 times [2024-10-24 15:36:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476660672] [2024-10-24 15:36:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476660672] [2024-10-24 15:36:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476660672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:19,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:19,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:19,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717112254] [2024-10-24 15:36:19,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:19,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:19,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 376 [2024-10-24 15:36:19,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 282 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-10-24 15:36:19,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:19,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 376 [2024-10-24 15:36:19,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:19,631 INFO L124 PetriNetUnfolderBase]: 991/4536 cut-off events. [2024-10-24 15:36:19,631 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-24 15:36:19,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 4536 events. 991/4536 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 36414 event pairs, 713 based on Foata normal form. 0/3876 useless extension candidates. Maximal degree in co-relation 5991. Up to 1475 conditions per place. [2024-10-24 15:36:19,661 INFO L140 encePairwiseOnDemand]: 373/376 looper letters, 26 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-10-24 15:36:19,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 281 transitions, 632 flow [2024-10-24 15:36:19,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1019 transitions. [2024-10-24 15:36:19,663 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9033687943262412 [2024-10-24 15:36:19,664 INFO L175 Difference]: Start difference. First operand has 285 places, 282 transitions, 578 flow. Second operand 3 states and 1019 transitions. [2024-10-24 15:36:19,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 281 transitions, 632 flow [2024-10-24 15:36:19,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 281 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:36:19,667 INFO L231 Difference]: Finished difference. Result has 284 places, 281 transitions, 576 flow [2024-10-24 15:36:19,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=284, PETRI_TRANSITIONS=281} [2024-10-24 15:36:19,668 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -13 predicate places. [2024-10-24 15:36:19,668 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 281 transitions, 576 flow [2024-10-24 15:36:19,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-10-24 15:36:19,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:19,669 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] [2024-10-24 15:36:19,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:36:19,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:19,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash 827617098, now seen corresponding path program 1 times [2024-10-24 15:36:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:19,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766530590] [2024-10-24 15:36:19,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766530590] [2024-10-24 15:36:19,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766530590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:19,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:19,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:19,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924511189] [2024-10-24 15:36:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:19,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:19,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:19,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:19,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:19,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 376 [2024-10-24 15:36:19,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 281 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 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-10-24 15:36:19,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:19,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 376 [2024-10-24 15:36:19,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:20,169 INFO L124 PetriNetUnfolderBase]: 1451/5051 cut-off events. [2024-10-24 15:36:20,169 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-10-24 15:36:20,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7245 conditions, 5051 events. 1451/5051 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 39310 event pairs, 507 based on Foata normal form. 0/4471 useless extension candidates. Maximal degree in co-relation 7184. Up to 2100 conditions per place. [2024-10-24 15:36:20,197 INFO L140 encePairwiseOnDemand]: 368/376 looper letters, 38 selfloop transitions, 3 changer transitions 0/289 dead transitions. [2024-10-24 15:36:20,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 289 transitions, 679 flow [2024-10-24 15:36:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2024-10-24 15:36:20,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-10-24 15:36:20,200 INFO L175 Difference]: Start difference. First operand has 284 places, 281 transitions, 576 flow. Second operand 3 states and 1012 transitions. [2024-10-24 15:36:20,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 289 transitions, 679 flow [2024-10-24 15:36:20,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 289 transitions, 675 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:36:20,204 INFO L231 Difference]: Finished difference. Result has 280 places, 279 transitions, 583 flow [2024-10-24 15:36:20,205 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=280, PETRI_TRANSITIONS=279} [2024-10-24 15:36:20,205 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -17 predicate places. [2024-10-24 15:36:20,206 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 279 transitions, 583 flow [2024-10-24 15:36:20,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 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-10-24 15:36:20,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:20,207 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] [2024-10-24 15:36:20,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:36:20,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:20,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash 959049721, now seen corresponding path program 1 times [2024-10-24 15:36:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075255904] [2024-10-24 15:36:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:20,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:20,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075255904] [2024-10-24 15:36:20,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075255904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:20,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:20,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:20,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936762021] [2024-10-24 15:36:20,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:20,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:20,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:20,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:20,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:20,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 376 [2024-10-24 15:36:20,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 279 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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-10-24 15:36:20,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:20,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 376 [2024-10-24 15:36:20,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:20,767 INFO L124 PetriNetUnfolderBase]: 1016/5592 cut-off events. [2024-10-24 15:36:20,767 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-10-24 15:36:20,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7331 conditions, 5592 events. 1016/5592 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 48749 event pairs, 681 based on Foata normal form. 0/4959 useless extension candidates. Maximal degree in co-relation 7270. Up to 1521 conditions per place. [2024-10-24 15:36:20,793 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 30 selfloop transitions, 3 changer transitions 0/285 dead transitions. [2024-10-24 15:36:20,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 285 transitions, 661 flow [2024-10-24 15:36:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1029 transitions. [2024-10-24 15:36:20,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9122340425531915 [2024-10-24 15:36:20,795 INFO L175 Difference]: Start difference. First operand has 280 places, 279 transitions, 583 flow. Second operand 3 states and 1029 transitions. [2024-10-24 15:36:20,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 285 transitions, 661 flow [2024-10-24 15:36:20,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 285 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:36:20,799 INFO L231 Difference]: Finished difference. Result has 280 places, 279 transitions, 598 flow [2024-10-24 15:36:20,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=280, PETRI_TRANSITIONS=279} [2024-10-24 15:36:20,800 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -17 predicate places. [2024-10-24 15:36:20,800 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 279 transitions, 598 flow [2024-10-24 15:36:20,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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-10-24 15:36:20,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:20,801 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] [2024-10-24 15:36:20,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:36:20,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:20,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash -551292339, now seen corresponding path program 1 times [2024-10-24 15:36:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:20,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919270332] [2024-10-24 15:36:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:20,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919270332] [2024-10-24 15:36:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919270332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:20,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375596216] [2024-10-24 15:36:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:20,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:20,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:20,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:20,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 376 [2024-10-24 15:36:20,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 279 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-10-24 15:36:20,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:20,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 376 [2024-10-24 15:36:20,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:21,790 INFO L124 PetriNetUnfolderBase]: 1809/8597 cut-off events. [2024-10-24 15:36:21,790 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-24 15:36:21,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11676 conditions, 8597 events. 1809/8597 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 77830 event pairs, 655 based on Foata normal form. 0/7431 useless extension candidates. Maximal degree in co-relation 11614. Up to 1443 conditions per place. [2024-10-24 15:36:21,843 INFO L140 encePairwiseOnDemand]: 365/376 looper letters, 44 selfloop transitions, 8 changer transitions 0/303 dead transitions. [2024-10-24 15:36:21,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 303 transitions, 756 flow [2024-10-24 15:36:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1042 transitions. [2024-10-24 15:36:21,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9237588652482269 [2024-10-24 15:36:21,846 INFO L175 Difference]: Start difference. First operand has 280 places, 279 transitions, 598 flow. Second operand 3 states and 1042 transitions. [2024-10-24 15:36:21,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 303 transitions, 756 flow [2024-10-24 15:36:21,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 303 transitions, 756 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:36:21,851 INFO L231 Difference]: Finished difference. Result has 284 places, 287 transitions, 668 flow [2024-10-24 15:36:21,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=284, PETRI_TRANSITIONS=287} [2024-10-24 15:36:21,852 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -13 predicate places. [2024-10-24 15:36:21,852 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 287 transitions, 668 flow [2024-10-24 15:36:21,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-10-24 15:36:21,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:21,853 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] [2024-10-24 15:36:21,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:36:21,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:21,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash -883591864, now seen corresponding path program 1 times [2024-10-24 15:36:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:21,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794015287] [2024-10-24 15:36:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:21,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:21,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:21,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794015287] [2024-10-24 15:36:21,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794015287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:21,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:21,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202820595] [2024-10-24 15:36:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:21,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:21,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:21,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:21,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 376 [2024-10-24 15:36:21,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 287 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 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-10-24 15:36:21,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:21,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 376 [2024-10-24 15:36:21,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:23,146 INFO L124 PetriNetUnfolderBase]: 2111/10634 cut-off events. [2024-10-24 15:36:23,146 INFO L125 PetriNetUnfolderBase]: For 156/164 co-relation queries the response was YES. [2024-10-24 15:36:23,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14451 conditions, 10634 events. 2111/10634 cut-off events. For 156/164 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 102424 event pairs, 1244 based on Foata normal form. 0/9540 useless extension candidates. Maximal degree in co-relation 14387. Up to 2835 conditions per place. [2024-10-24 15:36:23,191 INFO L140 encePairwiseOnDemand]: 371/376 looper letters, 35 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-10-24 15:36:23,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 297 transitions, 765 flow [2024-10-24 15:36:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1024 transitions. [2024-10-24 15:36:23,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9078014184397163 [2024-10-24 15:36:23,194 INFO L175 Difference]: Start difference. First operand has 284 places, 287 transitions, 668 flow. Second operand 3 states and 1024 transitions. [2024-10-24 15:36:23,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 297 transitions, 765 flow [2024-10-24 15:36:23,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 297 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:36:23,199 INFO L231 Difference]: Finished difference. Result has 282 places, 286 transitions, 660 flow [2024-10-24 15:36:23,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=282, PETRI_TRANSITIONS=286} [2024-10-24 15:36:23,200 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -15 predicate places. [2024-10-24 15:36:23,200 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 286 transitions, 660 flow [2024-10-24 15:36:23,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 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-10-24 15:36:23,200 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:23,201 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] [2024-10-24 15:36:23,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:36:23,201 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:23,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash 770097432, now seen corresponding path program 1 times [2024-10-24 15:36:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365715991] [2024-10-24 15:36:23,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:23,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:23,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365715991] [2024-10-24 15:36:23,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365715991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:23,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108459689] [2024-10-24 15:36:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:23,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:23,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:23,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:23,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 376 [2024-10-24 15:36:23,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 286 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-10-24 15:36:23,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:23,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 376 [2024-10-24 15:36:23,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:25,135 INFO L124 PetriNetUnfolderBase]: 4584/20435 cut-off events. [2024-10-24 15:36:25,135 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-10-24 15:36:25,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29161 conditions, 20435 events. 4584/20435 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 220965 event pairs, 2480 based on Foata normal form. 0/18516 useless extension candidates. Maximal degree in co-relation 29096. Up to 5342 conditions per place. [2024-10-24 15:36:25,416 INFO L140 encePairwiseOnDemand]: 366/376 looper letters, 45 selfloop transitions, 9 changer transitions 0/309 dead transitions. [2024-10-24 15:36:25,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 309 transitions, 820 flow [2024-10-24 15:36:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1042 transitions. [2024-10-24 15:36:25,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9237588652482269 [2024-10-24 15:36:25,418 INFO L175 Difference]: Start difference. First operand has 282 places, 286 transitions, 660 flow. Second operand 3 states and 1042 transitions. [2024-10-24 15:36:25,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 309 transitions, 820 flow [2024-10-24 15:36:25,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 309 transitions, 820 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:36:25,422 INFO L231 Difference]: Finished difference. Result has 286 places, 294 transitions, 730 flow [2024-10-24 15:36:25,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=286, PETRI_TRANSITIONS=294} [2024-10-24 15:36:25,423 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -11 predicate places. [2024-10-24 15:36:25,423 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 294 transitions, 730 flow [2024-10-24 15:36:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-10-24 15:36:25,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:25,424 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] [2024-10-24 15:36:25,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:36:25,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1103665336, now seen corresponding path program 1 times [2024-10-24 15:36:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521315546] [2024-10-24 15:36:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:25,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:25,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521315546] [2024-10-24 15:36:25,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521315546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:25,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:25,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:36:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508516841] [2024-10-24 15:36:25,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:25,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:36:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:25,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:36:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:36:25,615 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 376 [2024-10-24 15:36:25,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 294 transitions, 730 flow. Second operand has 5 states, 5 states have (on average 333.8) internal successors, (1669), 5 states have internal predecessors, (1669), 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-10-24 15:36:25,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:25,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 376 [2024-10-24 15:36:25,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:27,564 INFO L124 PetriNetUnfolderBase]: 2541/15373 cut-off events. [2024-10-24 15:36:27,565 INFO L125 PetriNetUnfolderBase]: For 522/586 co-relation queries the response was YES. [2024-10-24 15:36:27,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21711 conditions, 15373 events. 2541/15373 cut-off events. For 522/586 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 167377 event pairs, 1874 based on Foata normal form. 4/13953 useless extension candidates. Maximal degree in co-relation 21642. Up to 3397 conditions per place. [2024-10-24 15:36:27,641 INFO L140 encePairwiseOnDemand]: 367/376 looper letters, 36 selfloop transitions, 8 changer transitions 0/308 dead transitions. [2024-10-24 15:36:27,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 308 transitions, 845 flow [2024-10-24 15:36:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:36:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:36:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2037 transitions. [2024-10-24 15:36:27,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9029255319148937 [2024-10-24 15:36:27,644 INFO L175 Difference]: Start difference. First operand has 286 places, 294 transitions, 730 flow. Second operand 6 states and 2037 transitions. [2024-10-24 15:36:27,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 308 transitions, 845 flow [2024-10-24 15:36:27,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 308 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:36:27,652 INFO L231 Difference]: Finished difference. Result has 293 places, 298 transitions, 757 flow [2024-10-24 15:36:27,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=757, PETRI_PLACES=293, PETRI_TRANSITIONS=298} [2024-10-24 15:36:27,652 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -4 predicate places. [2024-10-24 15:36:27,652 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 298 transitions, 757 flow [2024-10-24 15:36:27,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 333.8) internal successors, (1669), 5 states have internal predecessors, (1669), 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-10-24 15:36:27,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:27,654 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] [2024-10-24 15:36:27,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:36:27,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:27,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:27,654 INFO L85 PathProgramCache]: Analyzing trace with hash 859261010, now seen corresponding path program 1 times [2024-10-24 15:36:27,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:27,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548482115] [2024-10-24 15:36:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:27,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:27,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:27,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548482115] [2024-10-24 15:36:27,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548482115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:27,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:27,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:36:27,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356485474] [2024-10-24 15:36:27,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:27,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:27,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:27,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:27,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:27,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 376 [2024-10-24 15:36:27,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 298 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 340.6666666666667) internal successors, (1022), 3 states have internal predecessors, (1022), 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-10-24 15:36:27,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:27,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 376 [2024-10-24 15:36:27,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:29,874 INFO L124 PetriNetUnfolderBase]: 3173/16912 cut-off events. [2024-10-24 15:36:29,875 INFO L125 PetriNetUnfolderBase]: For 218/233 co-relation queries the response was YES. [2024-10-24 15:36:29,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24086 conditions, 16912 events. 3173/16912 cut-off events. For 218/233 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 185318 event pairs, 1565 based on Foata normal form. 8/15135 useless extension candidates. Maximal degree in co-relation 24012. Up to 3710 conditions per place. [2024-10-24 15:36:29,949 INFO L140 encePairwiseOnDemand]: 372/376 looper letters, 33 selfloop transitions, 3 changer transitions 0/312 dead transitions. [2024-10-24 15:36:29,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 312 transitions, 860 flow [2024-10-24 15:36:29,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:36:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:36:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1054 transitions. [2024-10-24 15:36:29,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9343971631205674 [2024-10-24 15:36:29,952 INFO L175 Difference]: Start difference. First operand has 293 places, 298 transitions, 757 flow. Second operand 3 states and 1054 transitions. [2024-10-24 15:36:29,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 312 transitions, 860 flow [2024-10-24 15:36:29,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 312 transitions, 856 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:36:29,957 INFO L231 Difference]: Finished difference. Result has 295 places, 299 transitions, 767 flow [2024-10-24 15:36:29,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=295, PETRI_TRANSITIONS=299} [2024-10-24 15:36:29,958 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, -2 predicate places. [2024-10-24 15:36:29,958 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 299 transitions, 767 flow [2024-10-24 15:36:29,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.6666666666667) internal successors, (1022), 3 states have internal predecessors, (1022), 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-10-24 15:36:29,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:29,959 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] [2024-10-24 15:36:29,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:36:29,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:29,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash -889790364, now seen corresponding path program 1 times [2024-10-24 15:36:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:29,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266525898] [2024-10-24 15:36:29,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:36:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266525898] [2024-10-24 15:36:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266525898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:30,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:30,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:36:30,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176921941] [2024-10-24 15:36:30,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:30,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 15:36:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 15:36:30,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 15:36:30,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 376 [2024-10-24 15:36:30,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 299 transitions, 767 flow. Second operand has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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-10-24 15:36:30,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:30,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 376 [2024-10-24 15:36:30,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:32,398 INFO L124 PetriNetUnfolderBase]: 3642/18631 cut-off events. [2024-10-24 15:36:32,398 INFO L125 PetriNetUnfolderBase]: For 596/625 co-relation queries the response was YES. [2024-10-24 15:36:32,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26924 conditions, 18631 events. 3642/18631 cut-off events. For 596/625 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 204889 event pairs, 2424 based on Foata normal form. 4/16960 useless extension candidates. Maximal degree in co-relation 26847. Up to 4925 conditions per place. [2024-10-24 15:36:32,497 INFO L140 encePairwiseOnDemand]: 367/376 looper letters, 27 selfloop transitions, 4 changer transitions 13/307 dead transitions. [2024-10-24 15:36:32,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 307 transitions, 866 flow [2024-10-24 15:36:32,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:36:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:36:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2034 transitions. [2024-10-24 15:36:32,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.901595744680851 [2024-10-24 15:36:32,501 INFO L175 Difference]: Start difference. First operand has 295 places, 299 transitions, 767 flow. Second operand 6 states and 2034 transitions. [2024-10-24 15:36:32,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 307 transitions, 866 flow [2024-10-24 15:36:32,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 307 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:36:32,508 INFO L231 Difference]: Finished difference. Result has 301 places, 294 transitions, 751 flow [2024-10-24 15:36:32,509 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=751, PETRI_PLACES=301, PETRI_TRANSITIONS=294} [2024-10-24 15:36:32,509 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, 4 predicate places. [2024-10-24 15:36:32,510 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 294 transitions, 751 flow [2024-10-24 15:36:32,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 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-10-24 15:36:32,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:32,511 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] [2024-10-24 15:36:32,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:36:32,511 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:32,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1995195063, now seen corresponding path program 1 times [2024-10-24 15:36:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683276375] [2024-10-24 15:36:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:36:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683276375] [2024-10-24 15:36:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683276375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:36:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189540322] [2024-10-24 15:36:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:33,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:36:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:36:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:36:33,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 376 [2024-10-24 15:36:33,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 294 transitions, 751 flow. Second operand has 6 states, 6 states have (on average 317.8333333333333) internal successors, (1907), 6 states have internal predecessors, (1907), 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-10-24 15:36:33,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:33,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 376 [2024-10-24 15:36:33,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:37,424 INFO L124 PetriNetUnfolderBase]: 9821/33553 cut-off events. [2024-10-24 15:36:37,425 INFO L125 PetriNetUnfolderBase]: For 2737/2862 co-relation queries the response was YES. [2024-10-24 15:36:37,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56543 conditions, 33553 events. 9821/33553 cut-off events. For 2737/2862 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 372886 event pairs, 3782 based on Foata normal form. 1/30598 useless extension candidates. Maximal degree in co-relation 56462. Up to 11645 conditions per place. [2024-10-24 15:36:37,630 INFO L140 encePairwiseOnDemand]: 362/376 looper letters, 95 selfloop transitions, 46 changer transitions 0/390 dead transitions. [2024-10-24 15:36:37,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 390 transitions, 1307 flow [2024-10-24 15:36:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:36:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:36:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2021 transitions. [2024-10-24 15:36:37,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2024-10-24 15:36:37,634 INFO L175 Difference]: Start difference. First operand has 301 places, 294 transitions, 751 flow. Second operand 6 states and 2021 transitions. [2024-10-24 15:36:37,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 390 transitions, 1307 flow [2024-10-24 15:36:37,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 390 transitions, 1279 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-10-24 15:36:37,656 INFO L231 Difference]: Finished difference. Result has 297 places, 339 transitions, 1058 flow [2024-10-24 15:36:37,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1058, PETRI_PLACES=297, PETRI_TRANSITIONS=339} [2024-10-24 15:36:37,657 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, 0 predicate places. [2024-10-24 15:36:37,657 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 339 transitions, 1058 flow [2024-10-24 15:36:37,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 317.8333333333333) internal successors, (1907), 6 states have internal predecessors, (1907), 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-10-24 15:36:37,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:37,659 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] [2024-10-24 15:36:37,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:36:37,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:37,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:37,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1956534939, now seen corresponding path program 1 times [2024-10-24 15:36:37,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:37,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383567067] [2024-10-24 15:36:37,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:36:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383567067] [2024-10-24 15:36:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383567067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:37,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:37,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 15:36:37,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295547048] [2024-10-24 15:36:37,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:37,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 15:36:37,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:37,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 15:36:37,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 15:36:38,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 376 [2024-10-24 15:36:38,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 339 transitions, 1058 flow. Second operand has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 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-10-24 15:36:38,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:38,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 376 [2024-10-24 15:36:38,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:43,335 INFO L124 PetriNetUnfolderBase]: 9299/38944 cut-off events. [2024-10-24 15:36:43,336 INFO L125 PetriNetUnfolderBase]: For 3828/5863 co-relation queries the response was YES. [2024-10-24 15:36:43,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65021 conditions, 38944 events. 9299/38944 cut-off events. For 3828/5863 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 476590 event pairs, 4530 based on Foata normal form. 225/35410 useless extension candidates. Maximal degree in co-relation 64946. Up to 10395 conditions per place. [2024-10-24 15:36:43,551 INFO L140 encePairwiseOnDemand]: 364/376 looper letters, 64 selfloop transitions, 14 changer transitions 5/384 dead transitions. [2024-10-24 15:36:43,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 384 transitions, 1321 flow [2024-10-24 15:36:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:36:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-24 15:36:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3334 transitions. [2024-10-24 15:36:43,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8867021276595745 [2024-10-24 15:36:43,555 INFO L175 Difference]: Start difference. First operand has 297 places, 339 transitions, 1058 flow. Second operand 10 states and 3334 transitions. [2024-10-24 15:36:43,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 384 transitions, 1321 flow [2024-10-24 15:36:43,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 384 transitions, 1321 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 15:36:43,569 INFO L231 Difference]: Finished difference. Result has 310 places, 347 transitions, 1130 flow [2024-10-24 15:36:43,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1130, PETRI_PLACES=310, PETRI_TRANSITIONS=347} [2024-10-24 15:36:43,570 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, 13 predicate places. [2024-10-24 15:36:43,571 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 347 transitions, 1130 flow [2024-10-24 15:36:43,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 327.0) internal successors, (2289), 7 states have internal predecessors, (2289), 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-10-24 15:36:43,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:43,572 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] [2024-10-24 15:36:43,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 15:36:43,572 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:43,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash -328229590, now seen corresponding path program 1 times [2024-10-24 15:36:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:43,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607615484] [2024-10-24 15:36:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:36:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607615484] [2024-10-24 15:36:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607615484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:43,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:43,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 15:36:43,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612281002] [2024-10-24 15:36:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:43,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:36:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:36:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:36:44,123 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 376 [2024-10-24 15:36:44,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 347 transitions, 1130 flow. Second operand has 8 states, 8 states have (on average 321.875) internal successors, (2575), 8 states have internal predecessors, (2575), 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-10-24 15:36:44,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:44,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 376 [2024-10-24 15:36:44,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:50,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][308], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 96#L1066-8true, 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 441#true]) [2024-10-24 15:36:50,359 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-10-24 15:36:50,360 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-24 15:36:50,360 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-24 15:36:50,360 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-10-24 15:36:50,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][308], [30#L1034-5true, 20#L1066-9true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 400#(= |#race~flags~0| 0), Black: 435#(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: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 391#(= |#race~tids~0| 0), Black: 436#(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|)), 431#true, Black: 434#(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|)), 441#true]) [2024-10-24 15:36:50,380 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-10-24 15:36:50,380 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-24 15:36:50,380 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:50,380 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:50,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][308], [30#L1034-5true, 20#L1066-9true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 400#(= |#race~flags~0| 0), Black: 435#(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: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 391#(= |#race~tids~0| 0), Black: 436#(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|)), Black: 434#(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|)), 431#true, 441#true]) [2024-10-24 15:36:50,381 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-10-24 15:36:50,381 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:50,382 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:50,382 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-24 15:36:50,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][308], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 96#L1066-8true, 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 441#true]) [2024-10-24 15:36:50,382 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-10-24 15:36:50,382 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:50,382 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-24 15:36:50,382 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:50,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][308], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 400#(= |#race~flags~0| 0), Black: 435#(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: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 391#(= |#race~tids~0| 0), Black: 436#(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|)), 431#true, Black: 434#(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|)), 335#L1066-10true, 441#true]) [2024-10-24 15:36:50,401 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-10-24 15:36:50,401 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-24 15:36:50,401 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:50,401 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:50,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][308], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 400#(= |#race~flags~0| 0), Black: 435#(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: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 391#(= |#race~tids~0| 0), Black: 436#(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|)), 431#true, Black: 434#(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|)), 335#L1066-10true, 441#true]) [2024-10-24 15:36:50,401 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-10-24 15:36:50,402 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-24 15:36:50,402 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-24 15:36:50,402 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2024-10-24 15:36:50,567 INFO L124 PetriNetUnfolderBase]: 11388/45906 cut-off events. [2024-10-24 15:36:50,567 INFO L125 PetriNetUnfolderBase]: For 15978/18020 co-relation queries the response was YES. [2024-10-24 15:36:50,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85081 conditions, 45906 events. 11388/45906 cut-off events. For 15978/18020 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 564224 event pairs, 4097 based on Foata normal form. 119/42077 useless extension candidates. Maximal degree in co-relation 85000. Up to 9114 conditions per place. [2024-10-24 15:36:50,993 INFO L140 encePairwiseOnDemand]: 363/376 looper letters, 101 selfloop transitions, 44 changer transitions 0/417 dead transitions. [2024-10-24 15:36:50,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 417 transitions, 1712 flow [2024-10-24 15:36:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 15:36:50,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 15:36:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3616 transitions. [2024-10-24 15:36:50,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.874274661508704 [2024-10-24 15:36:50,999 INFO L175 Difference]: Start difference. First operand has 310 places, 347 transitions, 1130 flow. Second operand 11 states and 3616 transitions. [2024-10-24 15:36:50,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 417 transitions, 1712 flow [2024-10-24 15:36:51,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 417 transitions, 1704 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 15:36:51,033 INFO L231 Difference]: Finished difference. Result has 320 places, 368 transitions, 1447 flow [2024-10-24 15:36:51,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1447, PETRI_PLACES=320, PETRI_TRANSITIONS=368} [2024-10-24 15:36:51,034 INFO L277 CegarLoopForPetriNet]: 297 programPoint places, 23 predicate places. [2024-10-24 15:36:51,034 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 368 transitions, 1447 flow [2024-10-24 15:36:51,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 321.875) internal successors, (2575), 8 states have internal predecessors, (2575), 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-10-24 15:36:51,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:36:51,035 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] [2024-10-24 15:36:51,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 15:36:51,035 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-24 15:36:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:36:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash -568247690, now seen corresponding path program 1 times [2024-10-24 15:36:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:36:51,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508567873] [2024-10-24 15:36:51,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:36:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:36:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:36:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:36:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:36:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508567873] [2024-10-24 15:36:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508567873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:36:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:36:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:36:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304207068] [2024-10-24 15:36:51,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:36:51,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:36:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:36:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:36:51,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:36:51,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 376 [2024-10-24 15:36:51,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 368 transitions, 1447 flow. Second operand has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 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-10-24 15:36:51,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:36:51,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 376 [2024-10-24 15:36:51,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:36:52,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][262], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 389#true, Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 352#L1066-11true, 400#(= |#race~flags~0| 0), Black: 435#(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: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 391#(= |#race~tids~0| 0), Black: 436#(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|)), 431#true, Black: 434#(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|)), 441#true, 355#L1040-7true]) [2024-10-24 15:36:52,664 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is cut-off event [2024-10-24 15:36:52,665 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-24 15:36:52,665 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-24 15:36:52,665 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is cut-off event [2024-10-24 15:36:52,704 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][262], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 352#L1066-11true, 400#(= |#race~flags~0| 0), Black: 435#(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: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 391#(= |#race~tids~0| 0), Black: 436#(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|)), Black: 434#(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|)), 431#true, 355#L1040-7true, 441#true]) [2024-10-24 15:36:52,704 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2024-10-24 15:36:52,704 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-24 15:36:52,704 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-24 15:36:52,704 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-24 15:36:52,704 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-24 15:36:52,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][262], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 389#true, Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 352#L1066-11true, 400#(= |#race~flags~0| 0), Black: 435#(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|)), 143#L1041-5true, Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 391#(= |#race~tids~0| 0), Black: 436#(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|)), Black: 434#(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|)), 431#true, 441#true]) [2024-10-24 15:36:52,781 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-10-24 15:36:52,781 INFO L297 olderBase$Statistics]: existing Event has 195 ancestors and is cut-off event [2024-10-24 15:36:52,781 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-24 15:36:52,781 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-24 15:36:52,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 389#true, Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 96#L1066-8true, 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 400#(= |#race~flags~0| 0), Black: 435#(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: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 391#(= |#race~tids~0| 0), Black: 436#(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|)), 431#true, Black: 434#(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|)), 441#true]) [2024-10-24 15:36:52,862 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-24 15:36:52,862 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-24 15:36:52,862 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-24 15:36:52,862 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-24 15:36:52,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, 20#L1066-9true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 389#true, Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 441#true]) [2024-10-24 15:36:52,875 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-24 15:36:52,875 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,875 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,875 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 389#true, Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 96#L1066-8true, 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 400#(= |#race~flags~0| 0), Black: 435#(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: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 391#(= |#race~tids~0| 0), Black: 436#(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|)), 431#true, Black: 434#(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|)), 441#true]) [2024-10-24 15:36:52,876 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-24 15:36:52,876 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,876 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,876 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,877 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 96#L1066-8true, 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 441#true]) [2024-10-24 15:36:52,877 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-24 15:36:52,877 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-24 15:36:52,877 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-24 15:36:52,877 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-24 15:36:52,877 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-10-24 15:36:52,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 389#true, Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 335#L1066-10true, 441#true]) [2024-10-24 15:36:52,890 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-24 15:36:52,890 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,890 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,890 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, 20#L1066-9true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 389#true, Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 441#true]) [2024-10-24 15:36:52,890 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-24 15:36:52,890 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,890 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,890 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,891 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, 20#L1066-9true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 441#true]) [2024-10-24 15:36:52,891 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-24 15:36:52,891 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,891 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,891 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-24 15:36:52,891 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,892 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 96#L1066-8true, 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), 431#true, Black: 434#(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|)), 441#true]) [2024-10-24 15:36:52,892 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-24 15:36:52,892 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,892 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,892 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-24 15:36:52,892 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-24 15:36:52,907 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 389#true, Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 335#L1066-10true, 441#true]) [2024-10-24 15:36:52,907 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2024-10-24 15:36:52,907 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-24 15:36:52,907 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-24 15:36:52,907 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-24 15:36:52,908 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 39#L1043-4true, 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 335#L1066-10true, 441#true]) [2024-10-24 15:36:52,908 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-24 15:36:52,908 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,908 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,908 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,908 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-24 15:36:52,909 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, 20#L1066-9true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 441#true]) [2024-10-24 15:36:52,909 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-24 15:36:52,909 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,909 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,909 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-24 15:36:52,909 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-24 15:36:52,924 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([813] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][294], [30#L1034-5true, Black: 385#true, Black: 445#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 447#(= |cleanerThread1of1ForFork0_#t~mem11| 0), Black: 389#true, Black: 453#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 446#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 366#true, Black: 395#(= |#race~threads_alive~0| 0), 473#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 398#true, Black: 404#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 480#true, Black: 463#(not (= ~flags~0.base ~tids~0.base)), Black: 475#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 464#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), 375#(= |#race~threads_total~0| 0), Black: 409#(= |ULTIMATE.start_main_~i~2#1| 0), 368#true, Black: 420#(<= (+ ~threads_alive~0 1) 0), 387#(= |#race~flags_mutex~0| 0), 117#L1043-5true, 400#(= |#race~flags~0| 0), Black: 435#(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|)), 391#(= |#race~tids~0| 0), Black: 433#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 436#(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|)), Black: 434#(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|)), 431#true, 335#L1066-10true, 441#true]) [2024-10-24 15:36:52,924 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2024-10-24 15:36:52,924 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2024-10-24 15:36:52,924 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-24 15:36:52,924 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-24 15:36:52,925 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event