./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 21bb8f266262880d0d6873fb2e4e8bc5cd60f79baa0774ffc8a8aedd31b66692 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:19:37,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:19:37,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:19:37,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:19:37,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:19:37,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:19:37,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:19:37,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:19:37,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:19:37,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:19:37,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:19:37,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:19:37,308 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:19:37,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:19:37,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:19:37,309 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:19:37,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:19:37,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:19:37,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:19:37,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:19:37,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:19:37,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:19:37,315 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:19:37,316 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:19:37,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:19:37,316 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:19:37,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:19:37,317 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:19:37,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:19:37,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:19:37,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:19:37,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:19:37,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:19:37,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:19:37,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:19:37,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:19:37,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:19:37,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:19:37,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:19:37,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:19:37,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:19:37,321 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-clean/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-clean/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 -> 21bb8f266262880d0d6873fb2e4e8bc5cd60f79baa0774ffc8a8aedd31b66692 [2024-10-11 17:19:37,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:19:37,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:19:37,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:19:37,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:19:37,617 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:19:37,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-3.i [2024-10-11 17:19:39,027 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:19:39,307 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:19:39,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-3.i [2024-10-11 17:19:39,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9b5107e33/8174a4169ffd44a5a711a07cbc5d336b/FLAG61344487f [2024-10-11 17:19:39,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9b5107e33/8174a4169ffd44a5a711a07cbc5d336b [2024-10-11 17:19:39,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:19:39,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:19:39,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:19:39,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:19:39,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:19:39,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:19:39" (1/1) ... [2024-10-11 17:19:39,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5039d50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:39, skipping insertion in model container [2024-10-11 17:19:39,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:19:39" (1/1) ... [2024-10-11 17:19:39,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:19:39,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:19:39,892 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:19:39,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:19:40,015 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:19:40,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40 WrapperNode [2024-10-11 17:19:40,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:19:40,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:19:40,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:19:40,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:19:40,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,110 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 173 [2024-10-11 17:19:40,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:19:40,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:19:40,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:19:40,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:19:40,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:19:40,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:19:40,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:19:40,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:19:40,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (1/1) ... [2024-10-11 17:19:40,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:19:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:19:40,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:19:40,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:19:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:19:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:19:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:19:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:19:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:19:40,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:19:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:19:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-10-11 17:19:40,246 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-10-11 17:19:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:19:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-11 17:19:40,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-11 17:19:40,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:19:40,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:19:40,248 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:19:40,395 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:19:40,397 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:19:40,860 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:19:40,860 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:19:40,924 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:19:40,925 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 17:19:40,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:19:40 BoogieIcfgContainer [2024-10-11 17:19:40,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:19:40,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:19:40,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:19:40,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:19:40,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:19:39" (1/3) ... [2024-10-11 17:19:40,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e98c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:19:40, skipping insertion in model container [2024-10-11 17:19:40,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:19:40" (2/3) ... [2024-10-11 17:19:40,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e98c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:19:40, skipping insertion in model container [2024-10-11 17:19:40,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:19:40" (3/3) ... [2024-10-11 17:19:40,938 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-3.i [2024-10-11 17:19:40,954 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:19:40,955 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-10-11 17:19:40,955 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:19:41,062 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:19:41,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 363 places, 372 transitions, 758 flow [2024-10-11 17:19:41,310 INFO L124 PetriNetUnfolderBase]: 21/493 cut-off events. [2024-10-11 17:19:41,311 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:19:41,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 493 events. 21/493 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 913 event pairs, 0 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 376. Up to 6 conditions per place. [2024-10-11 17:19:41,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 363 places, 372 transitions, 758 flow [2024-10-11 17:19:41,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 300 transitions, 610 flow [2024-10-11 17:19:41,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:19:41,356 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;@54d9b008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:19:41,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-10-11 17:19:41,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:19:41,365 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2024-10-11 17:19:41,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:19:41,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:41,366 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:41,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:41,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1681053991, now seen corresponding path program 1 times [2024-10-11 17:19:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783778648] [2024-10-11 17:19:41,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:41,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:41,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783778648] [2024-10-11 17:19:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783778648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:41,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:41,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698865751] [2024-10-11 17:19:41,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:41,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:41,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:41,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:41,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 372 [2024-10-11 17:19:41,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 300 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:41,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:41,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 372 [2024-10-11 17:19:41,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:42,930 INFO L124 PetriNetUnfolderBase]: 654/4184 cut-off events. [2024-10-11 17:19:42,930 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 17:19:42,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 4184 events. 654/4184 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 32976 event pairs, 489 based on Foata normal form. 182/3679 useless extension candidates. Maximal degree in co-relation 5083. Up to 1006 conditions per place. [2024-10-11 17:19:42,972 INFO L140 encePairwiseOnDemand]: 362/372 looper letters, 28 selfloop transitions, 2 changer transitions 1/290 dead transitions. [2024-10-11 17:19:42,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 290 transitions, 650 flow [2024-10-11 17:19:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1013 transitions. [2024-10-11 17:19:42,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9077060931899642 [2024-10-11 17:19:42,998 INFO L175 Difference]: Start difference. First operand has 295 places, 300 transitions, 610 flow. Second operand 3 states and 1013 transitions. [2024-10-11 17:19:42,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 290 transitions, 650 flow [2024-10-11 17:19:43,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 290 transitions, 649 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:19:43,012 INFO L231 Difference]: Finished difference. Result has 292 places, 289 transitions, 591 flow [2024-10-11 17:19:43,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=292, PETRI_TRANSITIONS=289} [2024-10-11 17:19:43,019 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -3 predicate places. [2024-10-11 17:19:43,022 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 289 transitions, 591 flow [2024-10-11 17:19:43,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:43,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:43,023 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:43,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:19:43,024 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:43,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:43,025 INFO L85 PathProgramCache]: Analyzing trace with hash 300391726, now seen corresponding path program 1 times [2024-10-11 17:19:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:43,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90014293] [2024-10-11 17:19:43,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:43,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:43,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:43,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90014293] [2024-10-11 17:19:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90014293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:43,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:43,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:43,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709471592] [2024-10-11 17:19:43,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:43,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:43,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:43,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:43,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:43,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 372 [2024-10-11 17:19:43,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 289 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:43,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:43,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 372 [2024-10-11 17:19:43,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:44,033 INFO L124 PetriNetUnfolderBase]: 747/4627 cut-off events. [2024-10-11 17:19:44,034 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-11 17:19:44,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5814 conditions, 4627 events. 747/4627 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 37696 event pairs, 571 based on Foata normal form. 0/3907 useless extension candidates. Maximal degree in co-relation 5752. Up to 1153 conditions per place. [2024-10-11 17:19:44,072 INFO L140 encePairwiseOnDemand]: 364/372 looper letters, 31 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2024-10-11 17:19:44,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 282 transitions, 641 flow [2024-10-11 17:19:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2024-10-11 17:19:44,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8817204301075269 [2024-10-11 17:19:44,076 INFO L175 Difference]: Start difference. First operand has 292 places, 289 transitions, 591 flow. Second operand 3 states and 984 transitions. [2024-10-11 17:19:44,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 282 transitions, 641 flow [2024-10-11 17:19:44,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 282 transitions, 637 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:44,084 INFO L231 Difference]: Finished difference. Result has 284 places, 282 transitions, 575 flow [2024-10-11 17:19:44,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=284, PETRI_TRANSITIONS=282} [2024-10-11 17:19:44,085 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -11 predicate places. [2024-10-11 17:19:44,086 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 282 transitions, 575 flow [2024-10-11 17:19:44,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:44,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:44,087 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:44,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:19:44,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:44,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1935878167, now seen corresponding path program 1 times [2024-10-11 17:19:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:44,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284668337] [2024-10-11 17:19:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:44,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:44,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284668337] [2024-10-11 17:19:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284668337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:44,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:44,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110611102] [2024-10-11 17:19:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:44,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:44,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:44,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:44,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:44,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 372 [2024-10-11 17:19:44,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 282 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:44,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:44,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 372 [2024-10-11 17:19:44,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:45,066 INFO L124 PetriNetUnfolderBase]: 709/4412 cut-off events. [2024-10-11 17:19:45,066 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-10-11 17:19:45,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5546 conditions, 4412 events. 709/4412 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 36486 event pairs, 546 based on Foata normal form. 0/3737 useless extension candidates. Maximal degree in co-relation 5484. Up to 1102 conditions per place. [2024-10-11 17:19:45,105 INFO L140 encePairwiseOnDemand]: 369/372 looper letters, 24 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-10-11 17:19:45,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 281 transitions, 625 flow [2024-10-11 17:19:45,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-10-11 17:19:45,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9086021505376344 [2024-10-11 17:19:45,110 INFO L175 Difference]: Start difference. First operand has 284 places, 282 transitions, 575 flow. Second operand 3 states and 1014 transitions. [2024-10-11 17:19:45,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 281 transitions, 625 flow [2024-10-11 17:19:45,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 281 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:19:45,116 INFO L231 Difference]: Finished difference. Result has 284 places, 281 transitions, 576 flow [2024-10-11 17:19:45,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=284, PETRI_TRANSITIONS=281} [2024-10-11 17:19:45,118 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -11 predicate places. [2024-10-11 17:19:45,119 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 281 transitions, 576 flow [2024-10-11 17:19:45,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:45,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:45,120 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:45,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:19:45,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:45,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash -36157573, now seen corresponding path program 1 times [2024-10-11 17:19:45,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:45,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981397752] [2024-10-11 17:19:45,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:45,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981397752] [2024-10-11 17:19:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981397752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73483517] [2024-10-11 17:19:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:45,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:45,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 372 [2024-10-11 17:19:45,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 281 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:45,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:45,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 372 [2024-10-11 17:19:45,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:46,084 INFO L124 PetriNetUnfolderBase]: 835/4287 cut-off events. [2024-10-11 17:19:46,084 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 17:19:46,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 4287 events. 835/4287 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 33656 event pairs, 605 based on Foata normal form. 0/3652 useless extension candidates. Maximal degree in co-relation 5523. Up to 1258 conditions per place. [2024-10-11 17:19:46,114 INFO L140 encePairwiseOnDemand]: 369/372 looper letters, 24 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2024-10-11 17:19:46,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 280 transitions, 626 flow [2024-10-11 17:19:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2024-10-11 17:19:46,117 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9059139784946236 [2024-10-11 17:19:46,118 INFO L175 Difference]: Start difference. First operand has 284 places, 281 transitions, 576 flow. Second operand 3 states and 1011 transitions. [2024-10-11 17:19:46,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 280 transitions, 626 flow [2024-10-11 17:19:46,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 280 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:46,123 INFO L231 Difference]: Finished difference. Result has 283 places, 280 transitions, 574 flow [2024-10-11 17:19:46,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=283, PETRI_TRANSITIONS=280} [2024-10-11 17:19:46,125 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -12 predicate places. [2024-10-11 17:19:46,125 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 280 transitions, 574 flow [2024-10-11 17:19:46,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:46,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:46,128 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:46,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:19:46,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:46,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1081821747, now seen corresponding path program 1 times [2024-10-11 17:19:46,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:46,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346500554] [2024-10-11 17:19:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:46,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:46,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346500554] [2024-10-11 17:19:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346500554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670770170] [2024-10-11 17:19:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:46,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 372 [2024-10-11 17:19:46,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 280 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:46,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:46,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 372 [2024-10-11 17:19:46,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:46,867 INFO L124 PetriNetUnfolderBase]: 991/4520 cut-off events. [2024-10-11 17:19:46,868 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-10-11 17:19:46,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6037 conditions, 4520 events. 991/4520 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 36064 event pairs, 713 based on Foata normal form. 0/3860 useless extension candidates. Maximal degree in co-relation 5975. Up to 1475 conditions per place. [2024-10-11 17:19:46,900 INFO L140 encePairwiseOnDemand]: 369/372 looper letters, 26 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-10-11 17:19:46,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 279 transitions, 628 flow [2024-10-11 17:19:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:46,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2024-10-11 17:19:46,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9023297491039427 [2024-10-11 17:19:46,903 INFO L175 Difference]: Start difference. First operand has 283 places, 280 transitions, 574 flow. Second operand 3 states and 1007 transitions. [2024-10-11 17:19:46,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 279 transitions, 628 flow [2024-10-11 17:19:46,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 279 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:46,907 INFO L231 Difference]: Finished difference. Result has 282 places, 279 transitions, 572 flow [2024-10-11 17:19:46,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=282, PETRI_TRANSITIONS=279} [2024-10-11 17:19:46,909 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -13 predicate places. [2024-10-11 17:19:46,909 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 279 transitions, 572 flow [2024-10-11 17:19:46,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:46,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:46,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:46,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:19:46,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:46,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash 530795977, now seen corresponding path program 1 times [2024-10-11 17:19:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:46,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634544978] [2024-10-11 17:19:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:46,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:46,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634544978] [2024-10-11 17:19:46,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634544978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:46,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:46,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:46,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790636126] [2024-10-11 17:19:46,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:46,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:46,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:46,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:46,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 372 [2024-10-11 17:19:46,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 279 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:46,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:46,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 372 [2024-10-11 17:19:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:47,609 INFO L124 PetriNetUnfolderBase]: 1451/5037 cut-off events. [2024-10-11 17:19:47,609 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-10-11 17:19:47,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7231 conditions, 5037 events. 1451/5037 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 38946 event pairs, 507 based on Foata normal form. 0/4457 useless extension candidates. Maximal degree in co-relation 7170. Up to 2100 conditions per place. [2024-10-11 17:19:47,645 INFO L140 encePairwiseOnDemand]: 364/372 looper letters, 38 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2024-10-11 17:19:47,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 287 transitions, 675 flow [2024-10-11 17:19:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1000 transitions. [2024-10-11 17:19:47,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8960573476702509 [2024-10-11 17:19:47,649 INFO L175 Difference]: Start difference. First operand has 282 places, 279 transitions, 572 flow. Second operand 3 states and 1000 transitions. [2024-10-11 17:19:47,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 287 transitions, 675 flow [2024-10-11 17:19:47,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 287 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:47,656 INFO L231 Difference]: Finished difference. Result has 278 places, 277 transitions, 579 flow [2024-10-11 17:19:47,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=278, PETRI_TRANSITIONS=277} [2024-10-11 17:19:47,658 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -17 predicate places. [2024-10-11 17:19:47,658 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 277 transitions, 579 flow [2024-10-11 17:19:47,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:47,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:47,660 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:47,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:19:47,660 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:47,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1070794872, now seen corresponding path program 1 times [2024-10-11 17:19:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096686521] [2024-10-11 17:19:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096686521] [2024-10-11 17:19:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096686521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:47,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:47,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:47,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653102384] [2024-10-11 17:19:47,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:47,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:47,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:47,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 372 [2024-10-11 17:19:47,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 277 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:47,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:47,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 372 [2024-10-11 17:19:47,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:48,653 INFO L124 PetriNetUnfolderBase]: 958/5490 cut-off events. [2024-10-11 17:19:48,654 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-10-11 17:19:48,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7171 conditions, 5490 events. 958/5490 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 48192 event pairs, 625 based on Foata normal form. 0/4871 useless extension candidates. Maximal degree in co-relation 7110. Up to 1485 conditions per place. [2024-10-11 17:19:48,699 INFO L140 encePairwiseOnDemand]: 366/372 looper letters, 30 selfloop transitions, 3 changer transitions 0/283 dead transitions. [2024-10-11 17:19:48,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 283 transitions, 657 flow [2024-10-11 17:19:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2024-10-11 17:19:48,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9112903225806451 [2024-10-11 17:19:48,703 INFO L175 Difference]: Start difference. First operand has 278 places, 277 transitions, 579 flow. Second operand 3 states and 1017 transitions. [2024-10-11 17:19:48,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 283 transitions, 657 flow [2024-10-11 17:19:48,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 283 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:48,709 INFO L231 Difference]: Finished difference. Result has 278 places, 277 transitions, 594 flow [2024-10-11 17:19:48,709 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=278, PETRI_TRANSITIONS=277} [2024-10-11 17:19:48,710 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -17 predicate places. [2024-10-11 17:19:48,710 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 277 transitions, 594 flow [2024-10-11 17:19:48,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:48,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:48,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] [2024-10-11 17:19:48,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:19:48,711 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:48,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1380373427, now seen corresponding path program 1 times [2024-10-11 17:19:48,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:48,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260742502] [2024-10-11 17:19:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:48,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260742502] [2024-10-11 17:19:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260742502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:48,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:48,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002264056] [2024-10-11 17:19:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:48,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:48,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:48,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 372 [2024-10-11 17:19:48,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 277 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:48,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:48,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 372 [2024-10-11 17:19:48,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:50,113 INFO L124 PetriNetUnfolderBase]: 1809/8451 cut-off events. [2024-10-11 17:19:50,113 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-11 17:19:50,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11530 conditions, 8451 events. 1809/8451 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 76102 event pairs, 655 based on Foata normal form. 0/7288 useless extension candidates. Maximal degree in co-relation 11468. Up to 1443 conditions per place. [2024-10-11 17:19:50,164 INFO L140 encePairwiseOnDemand]: 361/372 looper letters, 44 selfloop transitions, 8 changer transitions 0/301 dead transitions. [2024-10-11 17:19:50,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 301 transitions, 752 flow [2024-10-11 17:19:50,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:50,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1030 transitions. [2024-10-11 17:19:50,167 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9229390681003584 [2024-10-11 17:19:50,167 INFO L175 Difference]: Start difference. First operand has 278 places, 277 transitions, 594 flow. Second operand 3 states and 1030 transitions. [2024-10-11 17:19:50,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 301 transitions, 752 flow [2024-10-11 17:19:50,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 301 transitions, 752 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:50,173 INFO L231 Difference]: Finished difference. Result has 282 places, 285 transitions, 664 flow [2024-10-11 17:19:50,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=282, PETRI_TRANSITIONS=285} [2024-10-11 17:19:50,175 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -13 predicate places. [2024-10-11 17:19:50,175 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 285 transitions, 664 flow [2024-10-11 17:19:50,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:50,176 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:50,176 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:50,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:19:50,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:50,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1377366104, now seen corresponding path program 1 times [2024-10-11 17:19:50,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:50,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929888577] [2024-10-11 17:19:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:50,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:50,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929888577] [2024-10-11 17:19:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929888577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049550829] [2024-10-11 17:19:50,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:50,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:50,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:50,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:50,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:50,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 372 [2024-10-11 17:19:50,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 285 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:50,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:50,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 372 [2024-10-11 17:19:50,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:51,479 INFO L124 PetriNetUnfolderBase]: 2111/10597 cut-off events. [2024-10-11 17:19:51,479 INFO L125 PetriNetUnfolderBase]: For 155/163 co-relation queries the response was YES. [2024-10-11 17:19:51,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14414 conditions, 10597 events. 2111/10597 cut-off events. For 155/163 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 102009 event pairs, 1244 based on Foata normal form. 0/9502 useless extension candidates. Maximal degree in co-relation 14350. Up to 2835 conditions per place. [2024-10-11 17:19:51,536 INFO L140 encePairwiseOnDemand]: 367/372 looper letters, 35 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2024-10-11 17:19:51,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 295 transitions, 761 flow [2024-10-11 17:19:51,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2024-10-11 17:19:51,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9068100358422939 [2024-10-11 17:19:51,540 INFO L175 Difference]: Start difference. First operand has 282 places, 285 transitions, 664 flow. Second operand 3 states and 1012 transitions. [2024-10-11 17:19:51,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 295 transitions, 761 flow [2024-10-11 17:19:51,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 295 transitions, 745 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:51,549 INFO L231 Difference]: Finished difference. Result has 280 places, 284 transitions, 656 flow [2024-10-11 17:19:51,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=280, PETRI_TRANSITIONS=284} [2024-10-11 17:19:51,551 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -15 predicate places. [2024-10-11 17:19:51,551 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 284 transitions, 656 flow [2024-10-11 17:19:51,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:51,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:51,552 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:51,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:19:51,552 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:51,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1004698420, now seen corresponding path program 1 times [2024-10-11 17:19:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:51,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876564512] [2024-10-11 17:19:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:51,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:51,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876564512] [2024-10-11 17:19:51,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876564512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637409877] [2024-10-11 17:19:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:51,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:51,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:51,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:51,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 372 [2024-10-11 17:19:51,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 284 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:51,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:51,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 372 [2024-10-11 17:19:51,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:54,352 INFO L124 PetriNetUnfolderBase]: 4584/20349 cut-off events. [2024-10-11 17:19:54,352 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-10-11 17:19:54,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29075 conditions, 20349 events. 4584/20349 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 219552 event pairs, 2480 based on Foata normal form. 0/18426 useless extension candidates. Maximal degree in co-relation 29010. Up to 5342 conditions per place. [2024-10-11 17:19:54,477 INFO L140 encePairwiseOnDemand]: 362/372 looper letters, 45 selfloop transitions, 9 changer transitions 0/307 dead transitions. [2024-10-11 17:19:54,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 307 transitions, 816 flow [2024-10-11 17:19:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:19:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:19:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1030 transitions. [2024-10-11 17:19:54,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9229390681003584 [2024-10-11 17:19:54,483 INFO L175 Difference]: Start difference. First operand has 280 places, 284 transitions, 656 flow. Second operand 3 states and 1030 transitions. [2024-10-11 17:19:54,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 307 transitions, 816 flow [2024-10-11 17:19:54,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 307 transitions, 816 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:19:54,493 INFO L231 Difference]: Finished difference. Result has 284 places, 292 transitions, 726 flow [2024-10-11 17:19:54,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=284, PETRI_TRANSITIONS=292} [2024-10-11 17:19:54,495 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -11 predicate places. [2024-10-11 17:19:54,495 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 292 transitions, 726 flow [2024-10-11 17:19:54,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:54,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:54,496 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:54,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:19:54,497 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:54,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1737899418, now seen corresponding path program 1 times [2024-10-11 17:19:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:54,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522067215] [2024-10-11 17:19:54,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522067215] [2024-10-11 17:19:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522067215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:54,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:54,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:19:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742288776] [2024-10-11 17:19:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:54,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:19:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:19:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:19:54,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 372 [2024-10-11 17:19:54,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 292 transitions, 726 flow. Second operand has 5 states, 5 states have (on average 329.8) internal successors, (1649), 5 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:54,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:54,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 372 [2024-10-11 17:19:54,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:57,082 INFO L124 PetriNetUnfolderBase]: 2538/15233 cut-off events. [2024-10-11 17:19:57,082 INFO L125 PetriNetUnfolderBase]: For 497/561 co-relation queries the response was YES. [2024-10-11 17:19:57,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21557 conditions, 15233 events. 2538/15233 cut-off events. For 497/561 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 166071 event pairs, 1887 based on Foata normal form. 4/13819 useless extension candidates. Maximal degree in co-relation 21488. Up to 3397 conditions per place. [2024-10-11 17:19:57,154 INFO L140 encePairwiseOnDemand]: 363/372 looper letters, 36 selfloop transitions, 8 changer transitions 0/306 dead transitions. [2024-10-11 17:19:57,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 306 transitions, 841 flow [2024-10-11 17:19:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:19:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:19:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2013 transitions. [2024-10-11 17:19:57,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9018817204301075 [2024-10-11 17:19:57,159 INFO L175 Difference]: Start difference. First operand has 284 places, 292 transitions, 726 flow. Second operand 6 states and 2013 transitions. [2024-10-11 17:19:57,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 306 transitions, 841 flow [2024-10-11 17:19:57,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 306 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:19:57,169 INFO L231 Difference]: Finished difference. Result has 291 places, 296 transitions, 753 flow [2024-10-11 17:19:57,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=753, PETRI_PLACES=291, PETRI_TRANSITIONS=296} [2024-10-11 17:19:57,170 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -4 predicate places. [2024-10-11 17:19:57,171 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 296 transitions, 753 flow [2024-10-11 17:19:57,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 329.8) internal successors, (1649), 5 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:57,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:19:57,172 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:19:57,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:19:57,172 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:19:57,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:19:57,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1410822513, now seen corresponding path program 1 times [2024-10-11 17:19:57,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:19:57,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143202566] [2024-10-11 17:19:57,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:19:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:19:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:19:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:19:57,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:19:57,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143202566] [2024-10-11 17:19:57,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143202566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:19:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:19:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:19:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260635672] [2024-10-11 17:19:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:19:57,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:19:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:19:57,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:19:57,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:19:57,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 372 [2024-10-11 17:19:57,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 296 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 337.6666666666667) internal successors, (1013), 3 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:19:57,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:19:57,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 372 [2024-10-11 17:19:57,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:19:59,989 INFO L124 PetriNetUnfolderBase]: 3409/17421 cut-off events. [2024-10-11 17:19:59,990 INFO L125 PetriNetUnfolderBase]: For 196/227 co-relation queries the response was YES. [2024-10-11 17:20:00,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24983 conditions, 17421 events. 3409/17421 cut-off events. For 196/227 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 191200 event pairs, 1915 based on Foata normal form. 2/15484 useless extension candidates. Maximal degree in co-relation 24910. Up to 3412 conditions per place. [2024-10-11 17:20:00,078 INFO L140 encePairwiseOnDemand]: 368/372 looper letters, 29 selfloop transitions, 3 changer transitions 0/307 dead transitions. [2024-10-11 17:20:00,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 307 transitions, 842 flow [2024-10-11 17:20:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2024-10-11 17:20:00,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9327956989247311 [2024-10-11 17:20:00,081 INFO L175 Difference]: Start difference. First operand has 291 places, 296 transitions, 753 flow. Second operand 3 states and 1041 transitions. [2024-10-11 17:20:00,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 307 transitions, 842 flow [2024-10-11 17:20:00,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 838 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:20:00,088 INFO L231 Difference]: Finished difference. Result has 294 places, 298 transitions, 771 flow [2024-10-11 17:20:00,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=294, PETRI_TRANSITIONS=298} [2024-10-11 17:20:00,089 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, -1 predicate places. [2024-10-11 17:20:00,089 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 298 transitions, 771 flow [2024-10-11 17:20:00,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.6666666666667) internal successors, (1013), 3 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:00,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:00,090 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:00,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:20:00,091 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:20:00,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1313676032, now seen corresponding path program 1 times [2024-10-11 17:20:00,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:00,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683206885] [2024-10-11 17:20:00,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:00,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:00,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:00,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683206885] [2024-10-11 17:20:00,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683206885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:00,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:00,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:00,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945343186] [2024-10-11 17:20:00,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:00,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:00,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:00,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:00,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:00,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 372 [2024-10-11 17:20:00,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 298 transitions, 771 flow. Second operand has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:00,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:00,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 372 [2024-10-11 17:20:00,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:03,233 INFO L124 PetriNetUnfolderBase]: 3863/20082 cut-off events. [2024-10-11 17:20:03,233 INFO L125 PetriNetUnfolderBase]: For 741/773 co-relation queries the response was YES. [2024-10-11 17:20:03,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29519 conditions, 20082 events. 3863/20082 cut-off events. For 741/773 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 225309 event pairs, 2596 based on Foata normal form. 6/18318 useless extension candidates. Maximal degree in co-relation 29443. Up to 5261 conditions per place. [2024-10-11 17:20:03,342 INFO L140 encePairwiseOnDemand]: 363/372 looper letters, 27 selfloop transitions, 4 changer transitions 17/310 dead transitions. [2024-10-11 17:20:03,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 310 transitions, 886 flow [2024-10-11 17:20:03,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2014 transitions. [2024-10-11 17:20:03,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9023297491039427 [2024-10-11 17:20:03,346 INFO L175 Difference]: Start difference. First operand has 294 places, 298 transitions, 771 flow. Second operand 6 states and 2014 transitions. [2024-10-11 17:20:03,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 310 transitions, 886 flow [2024-10-11 17:20:03,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 310 transitions, 880 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:20:03,358 INFO L231 Difference]: Finished difference. Result has 299 places, 293 transitions, 752 flow [2024-10-11 17:20:03,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=752, PETRI_PLACES=299, PETRI_TRANSITIONS=293} [2024-10-11 17:20:03,359 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2024-10-11 17:20:03,359 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 293 transitions, 752 flow [2024-10-11 17:20:03,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:03,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:03,360 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:03,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:20:03,360 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:20:03,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:03,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1823250055, now seen corresponding path program 1 times [2024-10-11 17:20:03,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:03,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105114637] [2024-10-11 17:20:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:04,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:04,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105114637] [2024-10-11 17:20:04,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105114637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:04,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:04,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715939900] [2024-10-11 17:20:04,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:04,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:04,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:04,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:04,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 372 [2024-10-11 17:20:04,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 293 transitions, 752 flow. Second operand has 6 states, 6 states have (on average 313.8333333333333) internal successors, (1883), 6 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:04,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:04,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 372 [2024-10-11 17:20:04,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:09,023 INFO L124 PetriNetUnfolderBase]: 9064/31618 cut-off events. [2024-10-11 17:20:09,024 INFO L125 PetriNetUnfolderBase]: For 2426/2544 co-relation queries the response was YES. [2024-10-11 17:20:09,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52913 conditions, 31618 events. 9064/31618 cut-off events. For 2426/2544 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 354479 event pairs, 3941 based on Foata normal form. 1/28682 useless extension candidates. Maximal degree in co-relation 52833. Up to 11134 conditions per place. [2024-10-11 17:20:09,218 INFO L140 encePairwiseOnDemand]: 358/372 looper letters, 95 selfloop transitions, 46 changer transitions 0/389 dead transitions. [2024-10-11 17:20:09,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 389 transitions, 1308 flow [2024-10-11 17:20:09,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1997 transitions. [2024-10-11 17:20:09,222 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8947132616487455 [2024-10-11 17:20:09,223 INFO L175 Difference]: Start difference. First operand has 299 places, 293 transitions, 752 flow. Second operand 6 states and 1997 transitions. [2024-10-11 17:20:09,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 389 transitions, 1308 flow [2024-10-11 17:20:09,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 389 transitions, 1280 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-10-11 17:20:09,247 INFO L231 Difference]: Finished difference. Result has 295 places, 338 transitions, 1059 flow [2024-10-11 17:20:09,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1059, PETRI_PLACES=295, PETRI_TRANSITIONS=338} [2024-10-11 17:20:09,248 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 0 predicate places. [2024-10-11 17:20:09,249 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 338 transitions, 1059 flow [2024-10-11 17:20:09,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 313.8333333333333) internal successors, (1883), 6 states have internal predecessors, (1883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:09,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:09,250 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:09,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:20:09,251 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:20:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash -323745759, now seen corresponding path program 1 times [2024-10-11 17:20:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358183008] [2024-10-11 17:20:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:09,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:09,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358183008] [2024-10-11 17:20:09,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358183008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:09,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:09,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:20:09,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808421524] [2024-10-11 17:20:09,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:09,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:20:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:09,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:20:09,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:20:09,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 372 [2024-10-11 17:20:09,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 338 transitions, 1059 flow. Second operand has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:09,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:09,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 372 [2024-10-11 17:20:09,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:16,088 INFO L124 PetriNetUnfolderBase]: 9628/39976 cut-off events. [2024-10-11 17:20:16,088 INFO L125 PetriNetUnfolderBase]: For 3856/5893 co-relation queries the response was YES. [2024-10-11 17:20:16,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66577 conditions, 39976 events. 9628/39976 cut-off events. For 3856/5893 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 491339 event pairs, 4721 based on Foata normal form. 254/36116 useless extension candidates. Maximal degree in co-relation 66503. Up to 10838 conditions per place. [2024-10-11 17:20:16,348 INFO L140 encePairwiseOnDemand]: 360/372 looper letters, 64 selfloop transitions, 14 changer transitions 10/387 dead transitions. [2024-10-11 17:20:16,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 387 transitions, 1338 flow [2024-10-11 17:20:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:20:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:20:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3298 transitions. [2024-10-11 17:20:16,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865591397849463 [2024-10-11 17:20:16,355 INFO L175 Difference]: Start difference. First operand has 295 places, 338 transitions, 1059 flow. Second operand 10 states and 3298 transitions. [2024-10-11 17:20:16,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 387 transitions, 1338 flow [2024-10-11 17:20:16,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 387 transitions, 1338 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:16,375 INFO L231 Difference]: Finished difference. Result has 308 places, 345 transitions, 1126 flow [2024-10-11 17:20:16,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1126, PETRI_PLACES=308, PETRI_TRANSITIONS=345} [2024-10-11 17:20:16,376 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 13 predicate places. [2024-10-11 17:20:16,376 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 345 transitions, 1126 flow [2024-10-11 17:20:16,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:16,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:16,377 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:16,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:20:16,377 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:20:16,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash 530157671, now seen corresponding path program 1 times [2024-10-11 17:20:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:16,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249402099] [2024-10-11 17:20:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:16,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:16,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249402099] [2024-10-11 17:20:16,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249402099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:16,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:16,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:20:16,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449165544] [2024-10-11 17:20:16,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:16,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:20:16,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:16,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:20:16,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:20:17,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 372 [2024-10-11 17:20:17,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 345 transitions, 1126 flow. Second operand has 8 states, 8 states have (on average 317.875) internal successors, (2543), 8 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:17,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:17,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 372 [2024-10-11 17:20:17,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:24,028 INFO L124 PetriNetUnfolderBase]: 11549/46076 cut-off events. [2024-10-11 17:20:24,029 INFO L125 PetriNetUnfolderBase]: For 15950/17616 co-relation queries the response was YES. [2024-10-11 17:20:24,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86328 conditions, 46076 events. 11549/46076 cut-off events. For 15950/17616 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 566377 event pairs, 3993 based on Foata normal form. 118/42413 useless extension candidates. Maximal degree in co-relation 86248. Up to 8409 conditions per place. [2024-10-11 17:20:24,345 INFO L140 encePairwiseOnDemand]: 359/372 looper letters, 101 selfloop transitions, 44 changer transitions 0/415 dead transitions. [2024-10-11 17:20:24,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 415 transitions, 1708 flow [2024-10-11 17:20:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:20:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:20:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3572 transitions. [2024-10-11 17:20:24,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8729227761485826 [2024-10-11 17:20:24,352 INFO L175 Difference]: Start difference. First operand has 308 places, 345 transitions, 1126 flow. Second operand 11 states and 3572 transitions. [2024-10-11 17:20:24,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 415 transitions, 1708 flow [2024-10-11 17:20:24,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 415 transitions, 1700 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:20:24,389 INFO L231 Difference]: Finished difference. Result has 318 places, 366 transitions, 1443 flow [2024-10-11 17:20:24,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1443, PETRI_PLACES=318, PETRI_TRANSITIONS=366} [2024-10-11 17:20:24,390 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 23 predicate places. [2024-10-11 17:20:24,391 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 366 transitions, 1443 flow [2024-10-11 17:20:24,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 317.875) internal successors, (2543), 8 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:24,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:24,392 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:24,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:20:24,393 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:20:24,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash 738399408, now seen corresponding path program 1 times [2024-10-11 17:20:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924880317] [2024-10-11 17:20:24,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:24,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:24,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924880317] [2024-10-11 17:20:24,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924880317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:24,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:24,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:24,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215279083] [2024-10-11 17:20:24,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:24,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:24,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:24,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:24,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:24,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 372 [2024-10-11 17:20:24,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 366 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:24,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:24,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 372 [2024-10-11 17:20:24,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:26,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][264], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 104#L1034-5true, 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, 10#L1040-7true, 346#L1066-11true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,436 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2024-10-11 17:20:26,436 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:26,436 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:26,437 INFO L297 olderBase$Statistics]: existing Event has 209 ancestors and is not cut-off event [2024-10-11 17:20:26,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 258#L1043-4true, Black: 416#(= |#race~data~0| 0), 477#true, 99#L1066-8true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,627 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-11 17:20:26,627 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:26,627 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:26,627 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:26,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 258#L1043-4true, Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 438#true, 387#(= |#race~tids~0| 0), 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 25#L1066-9true, 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,652 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,652 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,652 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,652 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 416#(= |#race~data~0| 0), 477#true, 99#L1066-8true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 160#L1043-5true, 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,655 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,655 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,655 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,655 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 385#true, Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), 331#L1066-10true, Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 258#L1043-4true, Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 438#true, 387#(= |#race~tids~0| 0), 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,678 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:26,678 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,678 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,678 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 438#true, 387#(= |#race~tids~0| 0), 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 25#L1066-9true, 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 160#L1043-5true, 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,679 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:26,679 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,679 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,679 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,681 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 258#L1043-4true, Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 99#L1066-8true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,681 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-11 17:20:26,682 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:26,682 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:26,682 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:26,682 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-10-11 17:20:26,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 385#true, Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), 331#L1066-10true, Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 438#true, 387#(= |#race~tids~0| 0), 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 160#L1043-5true, 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,708 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2024-10-11 17:20:26,709 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:26,709 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:26,709 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:26,710 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 385#true, Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 258#L1043-4true, Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 25#L1066-9true, Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,710 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,711 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,711 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,711 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,711 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,711 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 416#(= |#race~data~0| 0), 477#true, 99#L1066-8true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 160#L1043-5true, 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,712 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,712 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,712 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,712 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,712 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,713 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 258#L1043-4true, Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 99#L1066-8true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,713 INFO L294 olderBase$Statistics]: this new event has 225 ancestors and is cut-off event [2024-10-11 17:20:26,714 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:26,714 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-10-11 17:20:26,714 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:26,714 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is cut-off event [2024-10-11 17:20:26,714 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-10-11 17:20:26,973 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, 331#L1066-10true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 258#L1043-4true, Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,973 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:26,974 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,974 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-11 17:20:26,974 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,974 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,974 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 385#true, Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 25#L1066-9true, Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 160#L1043-5true, 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,974 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:26,974 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,974 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,974 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-11 17:20:26,974 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:26,976 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), 258#L1043-4true, Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 25#L1066-9true, 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,976 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,976 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,976 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,976 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,976 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,976 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,977 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 99#L1066-8true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 160#L1043-5true, 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,977 INFO L294 olderBase$Statistics]: this new event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,977 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,977 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,977 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,977 INFO L297 olderBase$Statistics]: existing Event has 226 ancestors and is cut-off event [2024-10-11 17:20:26,978 INFO L297 olderBase$Statistics]: existing Event has 205 ancestors and is cut-off event [2024-10-11 17:20:26,998 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, 331#L1066-10true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 160#L1043-5true, 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:26,999 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2024-10-11 17:20:26,999 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:26,999 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:26,999 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:26,999 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2024-10-11 17:20:27,000 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, 331#L1066-10true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 258#L1043-4true, Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:27,000 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:27,000 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:27,000 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-11 17:20:27,000 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:27,000 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:27,000 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-11 17:20:27,001 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 25#L1066-9true, 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 160#L1043-5true, 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:27,001 INFO L294 olderBase$Statistics]: this new event has 227 ancestors and is cut-off event [2024-10-11 17:20:27,001 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:27,001 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:27,001 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-11 17:20:27,001 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-11 17:20:27,001 INFO L297 olderBase$Statistics]: existing Event has 227 ancestors and is cut-off event [2024-10-11 17:20:27,020 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([807] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][293], [Black: 381#true, Black: 442#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 450#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 385#true, Black: 444#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 443#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 470#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 104#L1034-5true, Black: 391#(= |#race~threads_alive~0| 0), Black: 394#true, 331#L1066-10true, Black: 400#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 460#(not (= ~flags~0.base ~tids~0.base)), Black: 461#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 405#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 472#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 416#(= |#race~data~0| 0), 477#true, 428#true, 362#true, 387#(= |#race~tids~0| 0), 438#true, 383#(= |#race~flags_mutex~0| 0), 364#true, Black: 433#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 396#(= |#race~flags~0| 0), Black: 432#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 431#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 430#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 160#L1043-5true, 371#(= |#race~threads_total~0| 0)]) [2024-10-11 17:20:27,020 INFO L294 olderBase$Statistics]: this new event has 228 ancestors and is cut-off event [2024-10-11 17:20:27,020 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:27,020 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2024-10-11 17:20:27,020 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:27,020 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-11 17:20:27,021 INFO L297 olderBase$Statistics]: existing Event has 228 ancestors and is cut-off event [2024-10-11 17:20:29,934 INFO L124 PetriNetUnfolderBase]: 7483/33531 cut-off events. [2024-10-11 17:20:29,934 INFO L125 PetriNetUnfolderBase]: For 14269/16935 co-relation queries the response was YES. [2024-10-11 17:20:30,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61942 conditions, 33531 events. 7483/33531 cut-off events. For 14269/16935 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 415563 event pairs, 3650 based on Foata normal form. 106/31063 useless extension candidates. Maximal degree in co-relation 61860. Up to 7811 conditions per place. [2024-10-11 17:20:30,186 INFO L140 encePairwiseOnDemand]: 367/372 looper letters, 32 selfloop transitions, 5 changer transitions 0/379 dead transitions. [2024-10-11 17:20:30,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 379 transitions, 1545 flow [2024-10-11 17:20:30,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:20:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:20:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2024-10-11 17:20:30,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9310035842293907 [2024-10-11 17:20:30,188 INFO L175 Difference]: Start difference. First operand has 318 places, 366 transitions, 1443 flow. Second operand 3 states and 1039 transitions. [2024-10-11 17:20:30,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 379 transitions, 1545 flow [2024-10-11 17:20:30,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 379 transitions, 1534 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:20:30,246 INFO L231 Difference]: Finished difference. Result has 316 places, 369 transitions, 1468 flow [2024-10-11 17:20:30,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=372, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=316, PETRI_TRANSITIONS=369} [2024-10-11 17:20:30,247 INFO L277 CegarLoopForPetriNet]: 295 programPoint places, 21 predicate places. [2024-10-11 17:20:30,248 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 369 transitions, 1468 flow [2024-10-11 17:20:30,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:30,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:30,249 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] [2024-10-11 17:20:30,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:20:30,249 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-10-11 17:20:30,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:30,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1900634571, now seen corresponding path program 1 times [2024-10-11 17:20:30,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:30,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777173112] [2024-10-11 17:20:30,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:30,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:20:30,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777173112] [2024-10-11 17:20:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777173112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:20:30,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475953499] [2024-10-11 17:20:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:30,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:20:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:20:30,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:20:30,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 372 [2024-10-11 17:20:30,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 369 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:20:30,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:30,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 372 [2024-10-11 17:20:30,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand