./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-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 678d0822783009bcb35d951b8e726d754b85c570b149dafb90ced3b5185856fb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:02:35,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:02:35,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:02:35,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:02:35,802 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:02:35,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:02:35,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:02:35,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:02:35,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:02:35,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:02:35,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:02:35,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:02:35,842 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:02:35,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:02:35,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:02:35,846 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:02:35,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:02:35,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:02:35,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:02:35,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:02:35,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:02:35,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:02:35,850 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:02:35,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:02:35,850 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:02:35,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:02:35,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:02:35,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:02:35,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:02:35,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:02:35,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:02:35,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:02:35,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:02:35,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:02:35,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:02:35,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:02:35,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:02:35,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:02:35,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:02:35,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:02:35,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:02:35,856 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 -> 678d0822783009bcb35d951b8e726d754b85c570b149dafb90ced3b5185856fb [2024-11-19 06:02:36,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:02:36,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:02:36,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:02:36,154 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:02:36,154 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:02:36,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i [2024-11-19 06:02:37,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:02:37,951 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:02:37,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i [2024-11-19 06:02:37,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b83f1915/ea017ca3273d43d6a87f3257616c0382/FLAGcc6cdc341 [2024-11-19 06:02:38,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b83f1915/ea017ca3273d43d6a87f3257616c0382 [2024-11-19 06:02:38,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:02:38,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:02:38,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:02:38,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:02:38,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:02:38,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:38,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfdda00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38, skipping insertion in model container [2024-11-19 06:02:38,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:38,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:02:38,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:02:38,824 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:02:38,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:02:38,966 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:02:38,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38 WrapperNode [2024-11-19 06:02:38,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:02:38,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:02:38,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:02:38,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:02:38,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,083 INFO L138 Inliner]: procedures = 267, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2024-11-19 06:02:39,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:02:39,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:02:39,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:02:39,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:02:39,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:02:39,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:02:39,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:02:39,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:02:39,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (1/1) ... [2024-11-19 06:02:39,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:02:39,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:02:39,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:02:39,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:02:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:02:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 06:02:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 06:02:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 06:02:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 06:02:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:02:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:02:39,290 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-11-19 06:02:39,290 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-11-19 06:02:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 06:02:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-19 06:02:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-19 06:02:39,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:02:39,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:02:39,295 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 06:02:39,457 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:02:39,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:02:39,985 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:02:39,985 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:02:40,051 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:02:40,052 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 06:02:40,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:02:40 BoogieIcfgContainer [2024-11-19 06:02:40,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:02:40,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:02:40,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:02:40,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:02:40,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:02:38" (1/3) ... [2024-11-19 06:02:40,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a7181d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:02:40, skipping insertion in model container [2024-11-19 06:02:40,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:38" (2/3) ... [2024-11-19 06:02:40,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a7181d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:02:40, skipping insertion in model container [2024-11-19 06:02:40,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:02:40" (3/3) ... [2024-11-19 06:02:40,064 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-2.i [2024-11-19 06:02:40,082 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:02:40,082 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-19 06:02:40,084 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:02:40,200 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 06:02:40,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 446 places, 455 transitions, 924 flow [2024-11-19 06:02:40,494 INFO L124 PetriNetUnfolderBase]: 21/580 cut-off events. [2024-11-19 06:02:40,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 06:02:40,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 580 events. 21/580 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 945 event pairs, 0 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 376. Up to 6 conditions per place. [2024-11-19 06:02:40,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 455 transitions, 924 flow [2024-11-19 06:02:40,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 376 places, 381 transitions, 772 flow [2024-11-19 06:02:40,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:02:40,541 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;@700bea54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:02:40,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-19 06:02:40,562 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:02:40,562 INFO L124 PetriNetUnfolderBase]: 0/139 cut-off events. [2024-11-19 06:02:40,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:02:40,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:40,564 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:40,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:40,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:40,570 INFO L85 PathProgramCache]: Analyzing trace with hash -2016372737, now seen corresponding path program 1 times [2024-11-19 06:02:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:40,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852809852] [2024-11-19 06:02:40,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:40,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:41,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852809852] [2024-11-19 06:02:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852809852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:41,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:41,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:41,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581815157] [2024-11-19 06:02:41,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:41,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:41,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:41,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 455 [2024-11-19 06:02:41,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 381 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:41,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:41,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 455 [2024-11-19 06:02:41,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:41,894 INFO L124 PetriNetUnfolderBase]: 384/3043 cut-off events. [2024-11-19 06:02:41,895 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-19 06:02:41,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3676 conditions, 3043 events. 384/3043 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 21650 event pairs, 264 based on Foata normal form. 97/2626 useless extension candidates. Maximal degree in co-relation 3452. Up to 604 conditions per place. [2024-11-19 06:02:41,930 INFO L140 encePairwiseOnDemand]: 445/455 looper letters, 26 selfloop transitions, 2 changer transitions 1/371 dead transitions. [2024-11-19 06:02:41,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 371 transitions, 808 flow [2024-11-19 06:02:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:41,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2024-11-19 06:02:41,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9274725274725275 [2024-11-19 06:02:41,956 INFO L175 Difference]: Start difference. First operand has 376 places, 381 transitions, 772 flow. Second operand 3 states and 1266 transitions. [2024-11-19 06:02:41,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 371 transitions, 808 flow [2024-11-19 06:02:41,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 371 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:02:41,969 INFO L231 Difference]: Finished difference. Result has 373 places, 370 transitions, 753 flow [2024-11-19 06:02:41,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=373, PETRI_TRANSITIONS=370} [2024-11-19 06:02:41,977 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -3 predicate places. [2024-11-19 06:02:41,977 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 370 transitions, 753 flow [2024-11-19 06:02:41,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:41,979 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:41,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:41,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:02:41,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:41,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2133268588, now seen corresponding path program 1 times [2024-11-19 06:02:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082124877] [2024-11-19 06:02:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:42,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:42,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082124877] [2024-11-19 06:02:42,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082124877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:42,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:42,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642676587] [2024-11-19 06:02:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:42,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:42,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 455 [2024-11-19 06:02:42,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 370 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:42,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:42,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 455 [2024-11-19 06:02:42,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:42,880 INFO L124 PetriNetUnfolderBase]: 434/3311 cut-off events. [2024-11-19 06:02:42,880 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-19 06:02:42,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4032 conditions, 3311 events. 434/3311 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24196 event pairs, 309 based on Foata normal form. 0/2797 useless extension candidates. Maximal degree in co-relation 3883. Up to 688 conditions per place. [2024-11-19 06:02:42,917 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 29 selfloop transitions, 1 changer transitions 0/363 dead transitions. [2024-11-19 06:02:42,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 363 transitions, 799 flow [2024-11-19 06:02:42,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-11-19 06:02:42,922 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9062271062271062 [2024-11-19 06:02:42,922 INFO L175 Difference]: Start difference. First operand has 373 places, 370 transitions, 753 flow. Second operand 3 states and 1237 transitions. [2024-11-19 06:02:42,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 363 transitions, 799 flow [2024-11-19 06:02:42,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:42,933 INFO L231 Difference]: Finished difference. Result has 365 places, 363 transitions, 737 flow [2024-11-19 06:02:42,934 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=737, PETRI_PLACES=365, PETRI_TRANSITIONS=363} [2024-11-19 06:02:42,935 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -11 predicate places. [2024-11-19 06:02:42,935 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 363 transitions, 737 flow [2024-11-19 06:02:42,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:42,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:42,937 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:42,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:02:42,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:42,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:42,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2012854842, now seen corresponding path program 1 times [2024-11-19 06:02:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:42,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642290031] [2024-11-19 06:02:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:42,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642290031] [2024-11-19 06:02:43,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642290031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:43,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68031009] [2024-11-19 06:02:43,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:43,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:43,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:43,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:43,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 455 [2024-11-19 06:02:43,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 363 transitions, 737 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:43,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:43,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 455 [2024-11-19 06:02:43,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:43,718 INFO L124 PetriNetUnfolderBase]: 416/2963 cut-off events. [2024-11-19 06:02:43,718 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-19 06:02:43,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3653 conditions, 2963 events. 416/2963 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 21425 event pairs, 297 based on Foata normal form. 0/2522 useless extension candidates. Maximal degree in co-relation 3504. Up to 659 conditions per place. [2024-11-19 06:02:43,747 INFO L140 encePairwiseOnDemand]: 452/455 looper letters, 22 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-19 06:02:43,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 783 flow [2024-11-19 06:02:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2024-11-19 06:02:43,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9282051282051282 [2024-11-19 06:02:43,753 INFO L175 Difference]: Start difference. First operand has 365 places, 363 transitions, 737 flow. Second operand 3 states and 1267 transitions. [2024-11-19 06:02:43,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 362 transitions, 783 flow [2024-11-19 06:02:43,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 362 transitions, 782 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:02:43,760 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 738 flow [2024-11-19 06:02:43,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=365, PETRI_TRANSITIONS=362} [2024-11-19 06:02:43,762 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -11 predicate places. [2024-11-19 06:02:43,763 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 738 flow [2024-11-19 06:02:43,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:43,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:43,765 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:43,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:02:43,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:43,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1540715604, now seen corresponding path program 1 times [2024-11-19 06:02:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124302978] [2024-11-19 06:02:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:43,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:43,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124302978] [2024-11-19 06:02:43,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124302978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:43,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:43,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745409587] [2024-11-19 06:02:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:43,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:43,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:43,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:43,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 455 [2024-11-19 06:02:43,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:43,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:43,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 455 [2024-11-19 06:02:43,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:44,657 INFO L124 PetriNetUnfolderBase]: 554/3782 cut-off events. [2024-11-19 06:02:44,657 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-19 06:02:44,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 3782 events. 554/3782 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 29504 event pairs, 412 based on Foata normal form. 0/3236 useless extension candidates. Maximal degree in co-relation 4543. Up to 868 conditions per place. [2024-11-19 06:02:44,699 INFO L140 encePairwiseOnDemand]: 452/455 looper letters, 23 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-19 06:02:44,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 361 transitions, 786 flow [2024-11-19 06:02:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2024-11-19 06:02:44,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9245421245421246 [2024-11-19 06:02:44,759 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 738 flow. Second operand 3 states and 1262 transitions. [2024-11-19 06:02:44,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 361 transitions, 786 flow [2024-11-19 06:02:44,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 361 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:44,767 INFO L231 Difference]: Finished difference. Result has 364 places, 361 transitions, 736 flow [2024-11-19 06:02:44,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=364, PETRI_TRANSITIONS=361} [2024-11-19 06:02:44,769 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -12 predicate places. [2024-11-19 06:02:44,769 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 361 transitions, 736 flow [2024-11-19 06:02:44,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:44,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:44,771 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:44,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:02:44,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:44,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1635694494, now seen corresponding path program 1 times [2024-11-19 06:02:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247321413] [2024-11-19 06:02:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:44,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:44,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247321413] [2024-11-19 06:02:44,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247321413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:44,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:44,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869596882] [2024-11-19 06:02:44,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:44,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:44,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:44,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:44,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:44,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 455 [2024-11-19 06:02:44,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 361 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:44,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:44,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 455 [2024-11-19 06:02:44,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:45,634 INFO L124 PetriNetUnfolderBase]: 717/3617 cut-off events. [2024-11-19 06:02:45,635 INFO L125 PetriNetUnfolderBase]: For 63/101 co-relation queries the response was YES. [2024-11-19 06:02:45,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 3617 events. 717/3617 cut-off events. For 63/101 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 26921 event pairs, 505 based on Foata normal form. 0/2996 useless extension candidates. Maximal degree in co-relation 4585. Up to 1075 conditions per place. [2024-11-19 06:02:45,675 INFO L140 encePairwiseOnDemand]: 452/455 looper letters, 24 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-19 06:02:45,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 360 transitions, 786 flow [2024-11-19 06:02:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:45,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2024-11-19 06:02:45,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2024-11-19 06:02:45,680 INFO L175 Difference]: Start difference. First operand has 364 places, 361 transitions, 736 flow. Second operand 3 states and 1260 transitions. [2024-11-19 06:02:45,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 360 transitions, 786 flow [2024-11-19 06:02:45,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 360 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:45,687 INFO L231 Difference]: Finished difference. Result has 363 places, 360 transitions, 734 flow [2024-11-19 06:02:45,688 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=363, PETRI_TRANSITIONS=360} [2024-11-19 06:02:45,688 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -13 predicate places. [2024-11-19 06:02:45,689 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 360 transitions, 734 flow [2024-11-19 06:02:45,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:45,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:45,690 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:45,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:02:45,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:45,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash -102881728, now seen corresponding path program 1 times [2024-11-19 06:02:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:45,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056944674] [2024-11-19 06:02:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:45,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056944674] [2024-11-19 06:02:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056944674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:45,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:45,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:45,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673406373] [2024-11-19 06:02:45,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:45,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:45,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:45,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:45,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 455 [2024-11-19 06:02:45,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 360 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:45,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:45,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 455 [2024-11-19 06:02:45,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:46,427 INFO L124 PetriNetUnfolderBase]: 1108/4011 cut-off events. [2024-11-19 06:02:46,428 INFO L125 PetriNetUnfolderBase]: For 79/134 co-relation queries the response was YES. [2024-11-19 06:02:46,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 4011 events. 1108/4011 cut-off events. For 79/134 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 29145 event pairs, 575 based on Foata normal form. 0/3519 useless extension candidates. Maximal degree in co-relation 5573. Up to 1645 conditions per place. [2024-11-19 06:02:46,465 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 34 selfloop transitions, 3 changer transitions 0/366 dead transitions. [2024-11-19 06:02:46,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 366 transitions, 825 flow [2024-11-19 06:02:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1251 transitions. [2024-11-19 06:02:46,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9164835164835164 [2024-11-19 06:02:46,469 INFO L175 Difference]: Start difference. First operand has 363 places, 360 transitions, 734 flow. Second operand 3 states and 1251 transitions. [2024-11-19 06:02:46,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 366 transitions, 825 flow [2024-11-19 06:02:46,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 366 transitions, 821 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:46,476 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 741 flow [2024-11-19 06:02:46,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=741, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-11-19 06:02:46,479 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -17 predicate places. [2024-11-19 06:02:46,480 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 741 flow [2024-11-19 06:02:46,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.0) internal successors, (1212), 3 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:46,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:46,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:46,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:02:46,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -587546615, now seen corresponding path program 1 times [2024-11-19 06:02:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804202032] [2024-11-19 06:02:46,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:46,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804202032] [2024-11-19 06:02:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804202032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:46,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109327103] [2024-11-19 06:02:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:46,595 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 455 [2024-11-19 06:02:46,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:46,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:46,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 455 [2024-11-19 06:02:46,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:47,126 INFO L124 PetriNetUnfolderBase]: 550/3463 cut-off events. [2024-11-19 06:02:47,127 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-19 06:02:47,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4432 conditions, 3463 events. 550/3463 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26469 event pairs, 373 based on Foata normal form. 0/3047 useless extension candidates. Maximal degree in co-relation 4284. Up to 877 conditions per place. [2024-11-19 06:02:47,165 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 28 selfloop transitions, 3 changer transitions 0/364 dead transitions. [2024-11-19 06:02:47,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 364 transitions, 815 flow [2024-11-19 06:02:47,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-11-19 06:02:47,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9304029304029304 [2024-11-19 06:02:47,169 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 741 flow. Second operand 3 states and 1270 transitions. [2024-11-19 06:02:47,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 364 transitions, 815 flow [2024-11-19 06:02:47,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 364 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:47,176 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 756 flow [2024-11-19 06:02:47,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-11-19 06:02:47,177 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -17 predicate places. [2024-11-19 06:02:47,178 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 756 flow [2024-11-19 06:02:47,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:47,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:47,179 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:47,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:02:47,180 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:47,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1182274248, now seen corresponding path program 1 times [2024-11-19 06:02:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:47,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312493198] [2024-11-19 06:02:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:47,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:47,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312493198] [2024-11-19 06:02:47,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312493198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:47,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:47,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199807007] [2024-11-19 06:02:47,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:47,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:47,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 455 [2024-11-19 06:02:47,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:47,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:47,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 455 [2024-11-19 06:02:47,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:48,305 INFO L124 PetriNetUnfolderBase]: 1095/5816 cut-off events. [2024-11-19 06:02:48,305 INFO L125 PetriNetUnfolderBase]: For 87/93 co-relation queries the response was YES. [2024-11-19 06:02:48,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7794 conditions, 5816 events. 1095/5816 cut-off events. For 87/93 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 48121 event pairs, 396 based on Foata normal form. 0/5062 useless extension candidates. Maximal degree in co-relation 7645. Up to 908 conditions per place. [2024-11-19 06:02:48,345 INFO L140 encePairwiseOnDemand]: 444/455 looper letters, 40 selfloop transitions, 8 changer transitions 0/380 dead transitions. [2024-11-19 06:02:48,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 380 transitions, 902 flow [2024-11-19 06:02:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1281 transitions. [2024-11-19 06:02:48,349 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2024-11-19 06:02:48,349 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 756 flow. Second operand 3 states and 1281 transitions. [2024-11-19 06:02:48,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 380 transitions, 902 flow [2024-11-19 06:02:48,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 380 transitions, 902 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:48,357 INFO L231 Difference]: Finished difference. Result has 363 places, 366 transitions, 826 flow [2024-11-19 06:02:48,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=363, PETRI_TRANSITIONS=366} [2024-11-19 06:02:48,359 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -13 predicate places. [2024-11-19 06:02:48,359 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 366 transitions, 826 flow [2024-11-19 06:02:48,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:48,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:48,361 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:48,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:02:48,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:48,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash -803768017, now seen corresponding path program 1 times [2024-11-19 06:02:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343466408] [2024-11-19 06:02:48,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:48,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343466408] [2024-11-19 06:02:48,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343466408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:48,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:48,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:48,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683710870] [2024-11-19 06:02:48,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:48,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:48,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:48,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:48,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 455 [2024-11-19 06:02:48,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 366 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:48,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:48,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 455 [2024-11-19 06:02:48,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:50,369 INFO L124 PetriNetUnfolderBase]: 1920/9961 cut-off events. [2024-11-19 06:02:50,369 INFO L125 PetriNetUnfolderBase]: For 310/332 co-relation queries the response was YES. [2024-11-19 06:02:50,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13842 conditions, 9961 events. 1920/9961 cut-off events. For 310/332 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 93814 event pairs, 1079 based on Foata normal form. 0/9014 useless extension candidates. Maximal degree in co-relation 13691. Up to 2625 conditions per place. [2024-11-19 06:02:50,442 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 33 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2024-11-19 06:02:50,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 374 transitions, 917 flow [2024-11-19 06:02:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:50,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-11-19 06:02:50,448 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216117216117216 [2024-11-19 06:02:50,448 INFO L175 Difference]: Start difference. First operand has 363 places, 366 transitions, 826 flow. Second operand 3 states and 1258 transitions. [2024-11-19 06:02:50,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 374 transitions, 917 flow [2024-11-19 06:02:50,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 374 transitions, 901 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:50,460 INFO L231 Difference]: Finished difference. Result has 360 places, 365 transitions, 823 flow [2024-11-19 06:02:50,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=360, PETRI_TRANSITIONS=365} [2024-11-19 06:02:50,462 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -16 predicate places. [2024-11-19 06:02:50,462 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 365 transitions, 823 flow [2024-11-19 06:02:50,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:50,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:50,464 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:50,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:02:50,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:50,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:50,465 INFO L85 PathProgramCache]: Analyzing trace with hash -609409625, now seen corresponding path program 1 times [2024-11-19 06:02:50,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:50,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793105728] [2024-11-19 06:02:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:50,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:50,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793105728] [2024-11-19 06:02:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793105728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:50,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:50,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:50,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327982608] [2024-11-19 06:02:50,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:50,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:50,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:50,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:50,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:50,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 455 [2024-11-19 06:02:50,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 365 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:50,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:50,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 455 [2024-11-19 06:02:50,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:53,053 INFO L124 PetriNetUnfolderBase]: 2962/12886 cut-off events. [2024-11-19 06:02:53,054 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-19 06:02:53,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18763 conditions, 12886 events. 2962/12886 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 124415 event pairs, 1539 based on Foata normal form. 0/11579 useless extension candidates. Maximal degree in co-relation 18611. Up to 3590 conditions per place. [2024-11-19 06:02:53,140 INFO L140 encePairwiseOnDemand]: 445/455 looper letters, 38 selfloop transitions, 9 changer transitions 0/383 dead transitions. [2024-11-19 06:02:53,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 383 transitions, 956 flow [2024-11-19 06:02:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1278 transitions. [2024-11-19 06:02:53,144 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9362637362637363 [2024-11-19 06:02:53,144 INFO L175 Difference]: Start difference. First operand has 360 places, 365 transitions, 823 flow. Second operand 3 states and 1278 transitions. [2024-11-19 06:02:53,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 383 transitions, 956 flow [2024-11-19 06:02:53,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 383 transitions, 956 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:53,154 INFO L231 Difference]: Finished difference. Result has 364 places, 373 transitions, 893 flow [2024-11-19 06:02:53,156 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=364, PETRI_TRANSITIONS=373} [2024-11-19 06:02:53,157 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -12 predicate places. [2024-11-19 06:02:53,157 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 373 transitions, 893 flow [2024-11-19 06:02:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:53,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:53,159 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:53,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:02:53,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:53,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2058724206, now seen corresponding path program 1 times [2024-11-19 06:02:53,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:53,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603370089] [2024-11-19 06:02:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:53,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603370089] [2024-11-19 06:02:53,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603370089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:53,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:53,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:53,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733031275] [2024-11-19 06:02:53,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:53,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:02:53,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:53,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:02:53,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:02:53,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 455 [2024-11-19 06:02:53,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 373 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 414.8) internal successors, (2074), 5 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:53,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:53,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 455 [2024-11-19 06:02:53,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:55,265 INFO L124 PetriNetUnfolderBase]: 1614/8990 cut-off events. [2024-11-19 06:02:55,265 INFO L125 PetriNetUnfolderBase]: For 346/360 co-relation queries the response was YES. [2024-11-19 06:02:55,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13133 conditions, 8990 events. 1614/8990 cut-off events. For 346/360 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 85742 event pairs, 1106 based on Foata normal form. 4/8066 useless extension candidates. Maximal degree in co-relation 12977. Up to 1812 conditions per place. [2024-11-19 06:02:55,320 INFO L140 encePairwiseOnDemand]: 446/455 looper letters, 34 selfloop transitions, 8 changer transitions 0/387 dead transitions. [2024-11-19 06:02:55,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 387 transitions, 1004 flow [2024-11-19 06:02:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2024-11-19 06:02:55,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9234432234432235 [2024-11-19 06:02:55,326 INFO L175 Difference]: Start difference. First operand has 364 places, 373 transitions, 893 flow. Second operand 6 states and 2521 transitions. [2024-11-19 06:02:55,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 387 transitions, 1004 flow [2024-11-19 06:02:55,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 387 transitions, 986 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:55,337 INFO L231 Difference]: Finished difference. Result has 371 places, 377 transitions, 920 flow [2024-11-19 06:02:55,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=920, PETRI_PLACES=371, PETRI_TRANSITIONS=377} [2024-11-19 06:02:55,339 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -5 predicate places. [2024-11-19 06:02:55,339 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 377 transitions, 920 flow [2024-11-19 06:02:55,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 414.8) internal successors, (2074), 5 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:55,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:55,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:55,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:02:55,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash 901415286, now seen corresponding path program 1 times [2024-11-19 06:02:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:55,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166314981] [2024-11-19 06:02:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166314981] [2024-11-19 06:02:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166314981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:55,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493142486] [2024-11-19 06:02:55,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:55,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:55,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:55,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:55,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 455 [2024-11-19 06:02:55,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 377 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:55,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:55,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 455 [2024-11-19 06:02:55,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:57,604 INFO L124 PetriNetUnfolderBase]: 2381/11691 cut-off events. [2024-11-19 06:02:57,604 INFO L125 PetriNetUnfolderBase]: For 879/996 co-relation queries the response was YES. [2024-11-19 06:02:57,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17903 conditions, 11691 events. 2381/11691 cut-off events. For 879/996 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 114647 event pairs, 1326 based on Foata normal form. 31/10532 useless extension candidates. Maximal degree in co-relation 17742. Up to 2964 conditions per place. [2024-11-19 06:02:57,691 INFO L140 encePairwiseOnDemand]: 450/455 looper letters, 38 selfloop transitions, 6 changer transitions 0/389 dead transitions. [2024-11-19 06:02:57,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 389 transitions, 1043 flow [2024-11-19 06:02:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1276 transitions. [2024-11-19 06:02:57,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9347985347985348 [2024-11-19 06:02:57,696 INFO L175 Difference]: Start difference. First operand has 371 places, 377 transitions, 920 flow. Second operand 3 states and 1276 transitions. [2024-11-19 06:02:57,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 389 transitions, 1043 flow [2024-11-19 06:02:57,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 389 transitions, 1039 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 06:02:57,706 INFO L231 Difference]: Finished difference. Result has 374 places, 382 transitions, 970 flow [2024-11-19 06:02:57,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=970, PETRI_PLACES=374, PETRI_TRANSITIONS=382} [2024-11-19 06:02:57,709 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, -2 predicate places. [2024-11-19 06:02:57,710 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 382 transitions, 970 flow [2024-11-19 06:02:57,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:57,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:57,711 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:57,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:02:57,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:02:57,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1354689871, now seen corresponding path program 1 times [2024-11-19 06:02:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:57,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553341866] [2024-11-19 06:02:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:57,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:58,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:58,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553341866] [2024-11-19 06:02:58,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553341866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:58,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:58,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:58,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660848958] [2024-11-19 06:02:58,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:58,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:58,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:58,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:58,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:58,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 455 [2024-11-19 06:02:58,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 382 transitions, 970 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:58,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:58,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 455 [2024-11-19 06:02:58,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:01,283 INFO L124 PetriNetUnfolderBase]: 5084/19054 cut-off events. [2024-11-19 06:03:01,284 INFO L125 PetriNetUnfolderBase]: For 4224/4805 co-relation queries the response was YES. [2024-11-19 06:03:01,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33270 conditions, 19054 events. 5084/19054 cut-off events. For 4224/4805 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 195319 event pairs, 3234 based on Foata normal form. 17/17291 useless extension candidates. Maximal degree in co-relation 33109. Up to 7154 conditions per place. [2024-11-19 06:03:01,444 INFO L140 encePairwiseOnDemand]: 445/455 looper letters, 52 selfloop transitions, 13 changer transitions 0/400 dead transitions. [2024-11-19 06:03:01,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 400 transitions, 1161 flow [2024-11-19 06:03:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1248 transitions. [2024-11-19 06:03:01,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9142857142857143 [2024-11-19 06:03:01,447 INFO L175 Difference]: Start difference. First operand has 374 places, 382 transitions, 970 flow. Second operand 3 states and 1248 transitions. [2024-11-19 06:03:01,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 400 transitions, 1161 flow [2024-11-19 06:03:01,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 400 transitions, 1145 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:01,475 INFO L231 Difference]: Finished difference. Result has 376 places, 391 transitions, 1066 flow [2024-11-19 06:03:01,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=376, PETRI_TRANSITIONS=391} [2024-11-19 06:03:01,477 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 0 predicate places. [2024-11-19 06:03:01,477 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 391 transitions, 1066 flow [2024-11-19 06:03:01,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:01,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:01,478 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:01,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:03:01,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:03:01,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -619139727, now seen corresponding path program 1 times [2024-11-19 06:03:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:01,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980501490] [2024-11-19 06:03:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:03:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980501490] [2024-11-19 06:03:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980501490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:02,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:02,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626061192] [2024-11-19 06:03:02,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:02,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:03:02,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:02,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:03:02,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:03:02,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 455 [2024-11-19 06:03:02,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 391 transitions, 1066 flow. Second operand has 6 states, 6 states have (on average 397.8333333333333) internal successors, (2387), 6 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:02,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:02,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 455 [2024-11-19 06:03:02,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:06,960 INFO L124 PetriNetUnfolderBase]: 6465/23266 cut-off events. [2024-11-19 06:03:06,960 INFO L125 PetriNetUnfolderBase]: For 12562/13128 co-relation queries the response was YES. [2024-11-19 06:03:07,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44279 conditions, 23266 events. 6465/23266 cut-off events. For 12562/13128 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 246659 event pairs, 3397 based on Foata normal form. 33/21090 useless extension candidates. Maximal degree in co-relation 44116. Up to 7836 conditions per place. [2024-11-19 06:03:07,177 INFO L140 encePairwiseOnDemand]: 441/455 looper letters, 98 selfloop transitions, 54 changer transitions 0/486 dead transitions. [2024-11-19 06:03:07,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 486 transitions, 1776 flow [2024-11-19 06:03:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2492 transitions. [2024-11-19 06:03:07,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9128205128205128 [2024-11-19 06:03:07,184 INFO L175 Difference]: Start difference. First operand has 376 places, 391 transitions, 1066 flow. Second operand 6 states and 2492 transitions. [2024-11-19 06:03:07,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 486 transitions, 1776 flow [2024-11-19 06:03:07,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 486 transitions, 1694 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:07,241 INFO L231 Difference]: Finished difference. Result has 383 places, 443 transitions, 1496 flow [2024-11-19 06:03:07,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1496, PETRI_PLACES=383, PETRI_TRANSITIONS=443} [2024-11-19 06:03:07,242 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 7 predicate places. [2024-11-19 06:03:07,242 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 443 transitions, 1496 flow [2024-11-19 06:03:07,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 397.8333333333333) internal successors, (2387), 6 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:07,244 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:07,244 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:07,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:03:07,245 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:03:07,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash 84127552, now seen corresponding path program 1 times [2024-11-19 06:03:07,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:07,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680987663] [2024-11-19 06:03:07,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:03:07,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680987663] [2024-11-19 06:03:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680987663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:07,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:07,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:07,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068364607] [2024-11-19 06:03:07,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:07,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:03:07,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:03:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:03:07,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 455 [2024-11-19 06:03:07,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 443 transitions, 1496 flow. Second operand has 5 states, 5 states have (on average 415.0) internal successors, (2075), 5 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:07,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:07,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 455 [2024-11-19 06:03:07,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:10,738 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([950] L1029-4-->L1029-5: Formula: (= (store |v_#race_36| v_~datas~0.base_18 (store (select |v_#race_36| v_~datas~0.base_18) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_18) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} OutVars{#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} AuxVars[] AssignedVars[#race][445], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 240#L1072-4true, 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 239#L1029-5true, 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 70#L1038-6true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|)]) [2024-11-19 06:03:10,738 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2024-11-19 06:03:10,738 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:10,738 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:10,738 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:10,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([950] L1029-4-->L1029-5: Formula: (= (store |v_#race_36| v_~datas~0.base_18 (store (select |v_#race_36| v_~datas~0.base_18) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_18) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} OutVars{#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} AuxVars[] AssignedVars[#race][420], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 240#L1072-4true, 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 239#L1029-5true, 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 93#L1039true]) [2024-11-19 06:03:10,771 INFO L294 olderBase$Statistics]: this new event has 394 ancestors and is cut-off event [2024-11-19 06:03:10,771 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:10,771 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:10,771 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:10,899 INFO L124 PetriNetUnfolderBase]: 3986/19598 cut-off events. [2024-11-19 06:03:10,899 INFO L125 PetriNetUnfolderBase]: For 6579/7012 co-relation queries the response was YES. [2024-11-19 06:03:11,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35525 conditions, 19598 events. 3986/19598 cut-off events. For 6579/7012 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 212061 event pairs, 1729 based on Foata normal form. 19/17875 useless extension candidates. Maximal degree in co-relation 35357. Up to 4010 conditions per place. [2024-11-19 06:03:11,069 INFO L140 encePairwiseOnDemand]: 446/455 looper letters, 25 selfloop transitions, 4 changer transitions 17/455 dead transitions. [2024-11-19 06:03:11,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 455 transitions, 1607 flow [2024-11-19 06:03:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2024-11-19 06:03:11,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2024-11-19 06:03:11,074 INFO L175 Difference]: Start difference. First operand has 383 places, 443 transitions, 1496 flow. Second operand 6 states and 2522 transitions. [2024-11-19 06:03:11,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 455 transitions, 1607 flow [2024-11-19 06:03:11,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 455 transitions, 1567 flow, removed 20 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:11,103 INFO L231 Difference]: Finished difference. Result has 390 places, 438 transitions, 1443 flow [2024-11-19 06:03:11,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1443, PETRI_PLACES=390, PETRI_TRANSITIONS=438} [2024-11-19 06:03:11,105 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 14 predicate places. [2024-11-19 06:03:11,105 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 438 transitions, 1443 flow [2024-11-19 06:03:11,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 415.0) internal successors, (2075), 5 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:11,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:11,107 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:11,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:03:11,107 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:03:11,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash -20987959, now seen corresponding path program 1 times [2024-11-19 06:03:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:11,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198587802] [2024-11-19 06:03:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:03:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:11,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198587802] [2024-11-19 06:03:11,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198587802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:11,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:11,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:03:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069799948] [2024-11-19 06:03:11,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:11,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:03:11,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:03:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:03:12,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 455 [2024-11-19 06:03:12,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 438 transitions, 1443 flow. Second operand has 8 states, 8 states have (on average 402.875) internal successors, (3223), 8 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:12,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:12,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 455 [2024-11-19 06:03:12,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:16,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([950] L1029-4-->L1029-5: Formula: (= (store |v_#race_36| v_~datas~0.base_18 (store (select |v_#race_36| v_~datas~0.base_18) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_18) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} OutVars{#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} AuxVars[] AssignedVars[#race][427], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 521#(and (= cleanerThread1of1ForFork1_~i~1 0) (<= ~threads_total~0 0)), 239#L1029-5true, Black: 520#(<= ~threads_total~0 0), 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 70#L1038-6true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 127#L1061-11true]) [2024-11-19 06:03:16,178 INFO L294 olderBase$Statistics]: this new event has 388 ancestors and is cut-off event [2024-11-19 06:03:16,178 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-19 06:03:16,178 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-19 06:03:16,178 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-19 06:03:16,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([950] L1029-4-->L1029-5: Formula: (= (store |v_#race_36| v_~datas~0.base_18 (store (select |v_#race_36| v_~datas~0.base_18) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_18) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} OutVars{#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} AuxVars[] AssignedVars[#race][330], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 521#(and (= cleanerThread1of1ForFork1_~i~1 0) (<= ~threads_total~0 0)), 239#L1029-5true, Black: 520#(<= ~threads_total~0 0), 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 93#L1039true, 127#L1061-11true]) [2024-11-19 06:03:16,219 INFO L294 olderBase$Statistics]: this new event has 389 ancestors and is cut-off event [2024-11-19 06:03:16,219 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-19 06:03:16,219 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-19 06:03:16,219 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2024-11-19 06:03:16,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([950] L1029-4-->L1029-5: Formula: (= (store |v_#race_36| v_~datas~0.base_18 (store (select |v_#race_36| v_~datas~0.base_18) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_18) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} OutVars{#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} AuxVars[] AssignedVars[#race][330], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 521#(and (= cleanerThread1of1ForFork1_~i~1 0) (<= ~threads_total~0 0)), 239#L1029-5true, Black: 520#(<= ~threads_total~0 0), 517#true, Black: 464#true, 194#L1034-2true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 127#L1061-11true]) [2024-11-19 06:03:16,297 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2024-11-19 06:03:16,297 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-19 06:03:16,297 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:16,297 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:16,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([950] L1029-4-->L1029-5: Formula: (= (store |v_#race_36| v_~datas~0.base_18 (store (select |v_#race_36| v_~datas~0.base_18) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_18) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} OutVars{#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_18, ~datas~0.offset=v_~datas~0.offset_18} AuxVars[] AssignedVars[#race][330], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 521#(and (= cleanerThread1of1ForFork1_~i~1 0) (<= ~threads_total~0 0)), 239#L1029-5true, Black: 520#(<= ~threads_total~0 0), 517#true, Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 477#true, Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 489#(<= ~threads_total~0 0), Black: 492#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 490#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 127#L1061-11true]) [2024-11-19 06:03:16,339 INFO L294 olderBase$Statistics]: this new event has 395 ancestors and is cut-off event [2024-11-19 06:03:16,339 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-19 06:03:16,339 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:03:16,339 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-19 06:03:16,455 INFO L124 PetriNetUnfolderBase]: 6184/23998 cut-off events. [2024-11-19 06:03:16,456 INFO L125 PetriNetUnfolderBase]: For 17541/18474 co-relation queries the response was YES. [2024-11-19 06:03:16,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49503 conditions, 23998 events. 6184/23998 cut-off events. For 17541/18474 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 258656 event pairs, 2178 based on Foata normal form. 42/22081 useless extension candidates. Maximal degree in co-relation 49329. Up to 5440 conditions per place. [2024-11-19 06:03:16,705 INFO L140 encePairwiseOnDemand]: 442/455 looper letters, 100 selfloop transitions, 48 changer transitions 0/497 dead transitions. [2024-11-19 06:03:16,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 497 transitions, 2068 flow [2024-11-19 06:03:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:03:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 06:03:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4493 transitions. [2024-11-19 06:03:16,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8977022977022977 [2024-11-19 06:03:16,715 INFO L175 Difference]: Start difference. First operand has 390 places, 438 transitions, 1443 flow. Second operand 11 states and 4493 transitions. [2024-11-19 06:03:16,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 497 transitions, 2068 flow [2024-11-19 06:03:16,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 497 transitions, 2036 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-19 06:03:16,761 INFO L231 Difference]: Finished difference. Result has 391 places, 461 transitions, 1810 flow [2024-11-19 06:03:16,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1810, PETRI_PLACES=391, PETRI_TRANSITIONS=461} [2024-11-19 06:03:16,762 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 15 predicate places. [2024-11-19 06:03:16,763 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 461 transitions, 1810 flow [2024-11-19 06:03:16,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 402.875) internal successors, (3223), 8 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:16,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:16,765 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:16,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:03:16,765 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:03:16,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:16,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1642716452, now seen corresponding path program 1 times [2024-11-19 06:03:16,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:16,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475711439] [2024-11-19 06:03:16,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:16,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:03:16,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:16,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475711439] [2024-11-19 06:03:16,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475711439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:16,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:16,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733883314] [2024-11-19 06:03:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:16,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:16,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:16,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:16,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 455 [2024-11-19 06:03:16,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 461 transitions, 1810 flow. Second operand has 3 states, 3 states have (on average 414.6666666666667) internal successors, (1244), 3 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:16,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:16,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 455 [2024-11-19 06:03:16,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:18,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][222], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 239#L1029-5true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 171#ULTIMATE.startFINALtrue, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:18,474 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2024-11-19 06:03:18,474 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-19 06:03:18,474 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:18,474 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-19 06:03:18,517 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][222], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 218#L1030-5true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 171#ULTIMATE.startFINALtrue, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:18,517 INFO L294 olderBase$Statistics]: this new event has 305 ancestors and is cut-off event [2024-11-19 06:03:18,517 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-19 06:03:18,517 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2024-11-19 06:03:18,517 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-19 06:03:20,313 INFO L124 PetriNetUnfolderBase]: 3989/18763 cut-off events. [2024-11-19 06:03:20,313 INFO L125 PetriNetUnfolderBase]: For 12526/13365 co-relation queries the response was YES. [2024-11-19 06:03:20,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36577 conditions, 18763 events. 3989/18763 cut-off events. For 12526/13365 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 204971 event pairs, 1708 based on Foata normal form. 69/16968 useless extension candidates. Maximal degree in co-relation 36411. Up to 3802 conditions per place. [2024-11-19 06:03:20,470 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 36 selfloop transitions, 7 changer transitions 0/473 dead transitions. [2024-11-19 06:03:20,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 473 transitions, 1929 flow [2024-11-19 06:03:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1274 transitions. [2024-11-19 06:03:20,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-11-19 06:03:20,473 INFO L175 Difference]: Start difference. First operand has 391 places, 461 transitions, 1810 flow. Second operand 3 states and 1274 transitions. [2024-11-19 06:03:20,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 473 transitions, 1929 flow [2024-11-19 06:03:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 473 transitions, 1902 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-19 06:03:20,519 INFO L231 Difference]: Finished difference. Result has 389 places, 466 transitions, 1839 flow [2024-11-19 06:03:20,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1839, PETRI_PLACES=389, PETRI_TRANSITIONS=466} [2024-11-19 06:03:20,520 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 13 predicate places. [2024-11-19 06:03:20,520 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 466 transitions, 1839 flow [2024-11-19 06:03:20,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.6666666666667) internal successors, (1244), 3 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:20,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:20,521 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:20,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:03:20,522 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:03:20,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:20,522 INFO L85 PathProgramCache]: Analyzing trace with hash -915749032, now seen corresponding path program 1 times [2024-11-19 06:03:20,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699461654] [2024-11-19 06:03:20,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:03:20,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699461654] [2024-11-19 06:03:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699461654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:20,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:20,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:03:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586540752] [2024-11-19 06:03:20,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:20,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:03:20,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:20,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:03:20,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:03:20,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 455 [2024-11-19 06:03:20,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 466 transitions, 1839 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:20,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:20,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 455 [2024-11-19 06:03:20,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:23,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][501], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 70#L1038-6true, 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,099 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,099 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,099 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,100 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,185 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][501], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 70#L1038-6true, Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,185 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,186 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,186 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,186 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,186 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,188 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][501], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 70#L1038-6true, 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,188 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,188 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,188 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,188 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,188 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,188 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), 397#L1061-7true, Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true]) [2024-11-19 06:03:23,211 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-19 06:03:23,211 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-19 06:03:23,211 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-19 06:03:23,211 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2024-11-19 06:03:23,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][435], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 93#L1039true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,254 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,254 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,254 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,254 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L1038-4-->L1038-5: Formula: (= |v_#race_5| (store |v_#race_6| v_~datas~0.base_6 (store (select |v_#race_6| v_~datas~0.base_6) (+ v_cleanerThread1of1ForFork1_~i~1_23 v_~datas~0.offset_6) |v_cleanerThread1of1ForFork1_#t~nondet8_3|))) InVars {#race=|v_#race_6|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} OutVars{#race=|v_#race_5|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} AuxVars[] AssignedVars[#race][511], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, 240#L1072-4true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 195#L1038-5true, 507#true, 11#L1029-6true, Black: 502#true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,267 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,267 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,267 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,267 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,269 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][435], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 93#L1039true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,269 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,269 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,269 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,269 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,269 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), 447#true, 6#L1061-8true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true]) [2024-11-19 06:03:23,293 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,293 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,293 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-19 06:03:23,293 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2024-11-19 06:03:23,346 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][435], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), 553#true, Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 93#L1039true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,346 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,346 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,346 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,346 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,346 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,346 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 332#L1061-9true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true]) [2024-11-19 06:03:23,369 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,369 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,369 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,369 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-19 06:03:23,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][389], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 70#L1038-6true, Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 57#L1030true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,412 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,412 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,413 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,413 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L1038-4-->L1038-5: Formula: (= |v_#race_5| (store |v_#race_6| v_~datas~0.base_6 (store (select |v_#race_6| v_~datas~0.base_6) (+ v_cleanerThread1of1ForFork1_~i~1_23 v_~datas~0.offset_6) |v_cleanerThread1of1ForFork1_#t~nondet8_3|))) InVars {#race=|v_#race_6|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} OutVars{#race=|v_#race_5|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} AuxVars[] AssignedVars[#race][362], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, 240#L1072-4true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 57#L1030true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 195#L1038-5true, 507#true, Black: 502#true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,426 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,426 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,426 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,426 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2024-11-19 06:03:23,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 164#L1061-10true, 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 477#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true]) [2024-11-19 06:03:23,447 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2024-11-19 06:03:23,447 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-19 06:03:23,447 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-19 06:03:23,447 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-19 06:03:23,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, 445#true, Black: 468#true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 127#L1061-11true]) [2024-11-19 06:03:23,524 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2024-11-19 06:03:23,525 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-19 06:03:23,525 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-19 06:03:23,525 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-11-19 06:03:23,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][389], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 218#L1030-5true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 70#L1038-6true, 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,637 INFO L294 olderBase$Statistics]: this new event has 293 ancestors and is cut-off event [2024-11-19 06:03:23,637 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-19 06:03:23,637 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-19 06:03:23,637 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-19 06:03:23,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L1038-4-->L1038-5: Formula: (= |v_#race_5| (store |v_#race_6| v_~datas~0.base_6 (store (select |v_#race_6| v_~datas~0.base_6) (+ v_cleanerThread1of1ForFork1_~i~1_23 v_~datas~0.offset_6) |v_cleanerThread1of1ForFork1_#t~nondet8_3|))) InVars {#race=|v_#race_6|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} OutVars{#race=|v_#race_5|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} AuxVars[] AssignedVars[#race][362], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, 240#L1072-4true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 218#L1030-5true, Black: 464#true, Black: 468#true, 445#true, Black: 472#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 195#L1038-5true, 507#true, Black: 502#true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:23,649 INFO L294 olderBase$Statistics]: this new event has 293 ancestors and is cut-off event [2024-11-19 06:03:23,649 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-19 06:03:23,649 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-19 06:03:23,649 INFO L297 olderBase$Statistics]: existing Event has 293 ancestors and is cut-off event [2024-11-19 06:03:24,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([881] L1036-2-->L1036-5: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][328], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, 416#L1061-12true, Black: 474#(= |#race~threads_alive~0| 0), 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 272#L1036-5true, Black: 477#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 531#(not (= ~datas~0.base ~tids~0.base)), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 447#true, Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 555#(= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork0_~i~0 ~datas~0.offset))), 454#(= |#race~threads_total~0| 0), Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 548#true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true]) [2024-11-19 06:03:24,579 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-11-19 06:03:24,579 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2024-11-19 06:03:24,579 INFO L297 olderBase$Statistics]: existing Event has 238 ancestors and is cut-off event [2024-11-19 06:03:24,579 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2024-11-19 06:03:26,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][501], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), 553#true, Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), Black: 477#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 70#L1038-6true, 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:26,191 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,191 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,191 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,191 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,194 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][501], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 70#L1038-6true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:26,194 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,194 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,194 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,194 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,194 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L1038-4-->L1038-5: Formula: (= |v_#race_5| (store |v_#race_6| v_~datas~0.base_6 (store (select |v_#race_6| v_~datas~0.base_6) (+ v_cleanerThread1of1ForFork1_~i~1_23 v_~datas~0.offset_6) |v_cleanerThread1of1ForFork1_#t~nondet8_3|))) InVars {#race=|v_#race_6|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} OutVars{#race=|v_#race_5|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} AuxVars[] AssignedVars[#race][511], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, 240#L1072-4true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), Black: 477#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), 195#L1038-5true, Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, 11#L1029-6true, Black: 502#true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:26,530 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,530 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,530 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,530 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2024-11-19 06:03:26,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][435], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), 553#true, Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 93#L1039true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:26,533 INFO L294 olderBase$Statistics]: this new event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,533 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,533 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,533 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,571 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L1072-2-->L1072-3: Formula: (= (store |v_#race_30| v_~datas~0.base_12 (store (select |v_#race_30| v_~datas~0.base_12) v_~datas~0.offset_12 0)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_12, ~datas~0.offset=v_~datas~0.offset_12} AuxVars[] AssignedVars[#race][435], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 477#true, Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 328#L1072-3true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), Black: 497#true, 507#true, Black: 504#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) |cleanerThread1of1ForFork1_#t~nondet8|), 11#L1029-6true, 93#L1039true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:26,571 INFO L294 olderBase$Statistics]: this new event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,571 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,571 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,571 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,572 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L1038-4-->L1038-5: Formula: (= |v_#race_5| (store |v_#race_6| v_~datas~0.base_6 (store (select |v_#race_6| v_~datas~0.base_6) (+ v_cleanerThread1of1ForFork1_~i~1_23 v_~datas~0.offset_6) |v_cleanerThread1of1ForFork1_#t~nondet8_3|))) InVars {#race=|v_#race_6|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} OutVars{#race=|v_#race_5|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} AuxVars[] AssignedVars[#race][362], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, 240#L1072-4true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), Black: 477#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 57#L1030true, 466#(= |#race~datas_mutex~0| 0), Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 195#L1038-5true, 507#true, Black: 502#true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:26,610 INFO L294 olderBase$Statistics]: this new event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,610 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,610 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,610 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-19 06:03:26,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L1038-4-->L1038-5: Formula: (= |v_#race_5| (store |v_#race_6| v_~datas~0.base_6 (store (select |v_#race_6| v_~datas~0.base_6) (+ v_cleanerThread1of1ForFork1_~i~1_23 v_~datas~0.offset_6) |v_cleanerThread1of1ForFork1_#t~nondet8_3|))) InVars {#race=|v_#race_6|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} OutVars{#race=|v_#race_5|, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_23, ~datas~0.base=v_~datas~0.base_6, cleanerThread1of1ForFork1_#t~nondet8=|v_cleanerThread1of1ForFork1_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_6} AuxVars[] AssignedVars[#race][362], [Black: 511#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 509#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 553#true, 240#L1072-4true, Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 470#(= |#race~tids~0| 0), 479#(= |#race~datas~0| 0), 218#L1030-5true, Black: 464#true, Black: 468#true, 445#true, Black: 474#(= |#race~threads_alive~0| 0), Black: 477#true, Black: 543#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 532#(and (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 541#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 483#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 550#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 447#true, 454#(= |#race~threads_total~0| 0), 548#true, Black: 488#(= |ULTIMATE.start_main_~i~2#1| 0), 466#(= |#race~datas_mutex~0| 0), 195#L1038-5true, Black: 499#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 507#true, Black: 502#true, 531#(not (= ~datas~0.base ~tids~0.base))]) [2024-11-19 06:03:26,698 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-11-19 06:03:26,698 INFO L297 olderBase$Statistics]: existing Event has 397 ancestors and is cut-off event [2024-11-19 06:03:26,698 INFO L297 olderBase$Statistics]: existing Event has 397 ancestors and is cut-off event [2024-11-19 06:03:26,698 INFO L297 olderBase$Statistics]: existing Event has 397 ancestors and is cut-off event [2024-11-19 06:03:26,849 INFO L124 PetriNetUnfolderBase]: 11577/34958 cut-off events. [2024-11-19 06:03:26,849 INFO L125 PetriNetUnfolderBase]: For 46666/48449 co-relation queries the response was YES. [2024-11-19 06:03:27,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82473 conditions, 34958 events. 11577/34958 cut-off events. For 46666/48449 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 376672 event pairs, 4769 based on Foata normal form. 61/31424 useless extension candidates. Maximal degree in co-relation 82306. Up to 14545 conditions per place. [2024-11-19 06:03:27,203 INFO L140 encePairwiseOnDemand]: 440/455 looper letters, 96 selfloop transitions, 90 changer transitions 0/540 dead transitions. [2024-11-19 06:03:27,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 540 transitions, 2770 flow [2024-11-19 06:03:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:03:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:03:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2024-11-19 06:03:27,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9216117216117216 [2024-11-19 06:03:27,206 INFO L175 Difference]: Start difference. First operand has 389 places, 466 transitions, 1839 flow. Second operand 3 states and 1258 transitions. [2024-11-19 06:03:27,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 540 transitions, 2770 flow [2024-11-19 06:03:27,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 540 transitions, 2756 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:03:27,286 INFO L231 Difference]: Finished difference. Result has 391 places, 530 transitions, 2854 flow [2024-11-19 06:03:27,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2854, PETRI_PLACES=391, PETRI_TRANSITIONS=530} [2024-11-19 06:03:27,287 INFO L277 CegarLoopForPetriNet]: 376 programPoint places, 15 predicate places. [2024-11-19 06:03:27,287 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 530 transitions, 2854 flow [2024-11-19 06:03:27,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:27,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:27,288 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:03:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:03:27,288 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 06:03:27,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1422297009, now seen corresponding path program 1 times [2024-11-19 06:03:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220261626] [2024-11-19 06:03:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:03:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:28,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220261626] [2024-11-19 06:03:28,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220261626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:28,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:28,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:03:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188631323] [2024-11-19 06:03:28,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:28,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:03:28,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:28,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:03:28,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:03:29,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 389 out of 455 [2024-11-19 06:03:29,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 530 transitions, 2854 flow. Second operand has 11 states, 11 states have (on average 390.72727272727275) internal successors, (4298), 11 states have internal predecessors, (4298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:29,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:29,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 389 of 455 [2024-11-19 06:03:29,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand