./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:49:09,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:49:09,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:49:09,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:49:09,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:49:09,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:49:09,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:49:09,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:49:09,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:49:09,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:49:09,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:49:09,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:49:09,143 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:49:09,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:49:09,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:49:09,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:49:09,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:49:09,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:49:09,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:49:09,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:49:09,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:49:09,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:49:09,151 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:49:09,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:49:09,152 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:49:09,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:49:09,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:49:09,153 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:49:09,153 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:49:09,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:49:09,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:49:09,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:49:09,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:49:09,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:49:09,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:49:09,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:49:09,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:49:09,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:49:09,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:49:09,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:49:09,156 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:49:09,158 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 [2024-11-16 23:49:09,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:49:09,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:49:09,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:49:09,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:49:09,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:49:09,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2024-11-16 23:49:10,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:49:11,207 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:49:11,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2024-11-16 23:49:11,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc8c27b28/21431e4dd1624e18aab9a6e6f00b39c0/FLAGa23649e73 [2024-11-16 23:49:11,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc8c27b28/21431e4dd1624e18aab9a6e6f00b39c0 [2024-11-16 23:49:11,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:49:11,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:49:11,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:49:11,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:49:11,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:49:11,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:49:11" (1/1) ... [2024-11-16 23:49:11,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53198724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:11, skipping insertion in model container [2024-11-16 23:49:11,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:49:11" (1/1) ... [2024-11-16 23:49:11,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:49:12,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:49:12,090 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:49:12,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:49:12,287 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:49:12,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12 WrapperNode [2024-11-16 23:49:12,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:49:12,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:49:12,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:49:12,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:49:12,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,365 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2024-11-16 23:49:12,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:49:12,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:49:12,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:49:12,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:49:12,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:49:12,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:49:12,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:49:12,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:49:12,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (1/1) ... [2024-11-16 23:49:12,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:49:12,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:49:12,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:49:12,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:49:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:49:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-16 23:49:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:49:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:49:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-16 23:49:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:49:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:49:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-11-16 23:49:12,494 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-11-16 23:49:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:49:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-16 23:49:12,494 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-16 23:49:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:49:12,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:49:12,496 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:49:12,662 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:49:12,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:49:13,146 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:49:13,146 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:49:13,192 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:49:13,193 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:49:13,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:49:13 BoogieIcfgContainer [2024-11-16 23:49:13,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:49:13,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:49:13,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:49:13,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:49:13,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:49:11" (1/3) ... [2024-11-16 23:49:13,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc59933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:49:13, skipping insertion in model container [2024-11-16 23:49:13,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:49:12" (2/3) ... [2024-11-16 23:49:13,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc59933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:49:13, skipping insertion in model container [2024-11-16 23:49:13,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:49:13" (3/3) ... [2024-11-16 23:49:13,203 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter.i [2024-11-16 23:49:13,220 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:49:13,220 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-16 23:49:13,221 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:49:13,327 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:49:13,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 464 places, 473 transitions, 960 flow [2024-11-16 23:49:13,632 INFO L124 PetriNetUnfolderBase]: 21/592 cut-off events. [2024-11-16 23:49:13,633 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:49:13,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 592 events. 21/592 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 997 event pairs, 0 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 380. Up to 6 conditions per place. [2024-11-16 23:49:13,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 464 places, 473 transitions, 960 flow [2024-11-16 23:49:13,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 393 places, 398 transitions, 806 flow [2024-11-16 23:49:13,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:49:13,685 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;@3ed3aa0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:49:13,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2024-11-16 23:49:13,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:49:13,716 INFO L124 PetriNetUnfolderBase]: 0/148 cut-off events. [2024-11-16 23:49:13,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:49:13,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:13,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:13,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:13,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1098479836, now seen corresponding path program 1 times [2024-11-16 23:49:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:13,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360067797] [2024-11-16 23:49:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:14,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360067797] [2024-11-16 23:49:14,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360067797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:14,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:14,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857962622] [2024-11-16 23:49:14,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:14,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:14,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:14,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:14,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 473 [2024-11-16 23:49:14,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 398 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:14,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:14,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 473 [2024-11-16 23:49:14,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:15,470 INFO L124 PetriNetUnfolderBase]: 617/3927 cut-off events. [2024-11-16 23:49:15,470 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-16 23:49:15,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 3927 events. 617/3927 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 29848 event pairs, 482 based on Foata normal form. 180/3508 useless extension candidates. Maximal degree in co-relation 4710. Up to 985 conditions per place. [2024-11-16 23:49:15,507 INFO L140 encePairwiseOnDemand]: 463/473 looper letters, 28 selfloop transitions, 2 changer transitions 1/388 dead transitions. [2024-11-16 23:49:15,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 388 transitions, 846 flow [2024-11-16 23:49:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1316 transitions. [2024-11-16 23:49:15,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9274136715997181 [2024-11-16 23:49:15,535 INFO L175 Difference]: Start difference. First operand has 393 places, 398 transitions, 806 flow. Second operand 3 states and 1316 transitions. [2024-11-16 23:49:15,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 388 transitions, 846 flow [2024-11-16 23:49:15,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 388 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:49:15,552 INFO L231 Difference]: Finished difference. Result has 390 places, 387 transitions, 787 flow [2024-11-16 23:49:15,555 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=390, PETRI_TRANSITIONS=387} [2024-11-16 23:49:15,559 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -3 predicate places. [2024-11-16 23:49:15,559 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 387 transitions, 787 flow [2024-11-16 23:49:15,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:15,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:15,562 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:15,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:49:15,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:15,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2093176958, now seen corresponding path program 1 times [2024-11-16 23:49:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936754881] [2024-11-16 23:49:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:15,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936754881] [2024-11-16 23:49:15,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936754881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:15,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:15,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400697312] [2024-11-16 23:49:15,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:15,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:15,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:15,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:15,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 473 [2024-11-16 23:49:15,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 387 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:15,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:15,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 473 [2024-11-16 23:49:15,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:16,676 INFO L124 PetriNetUnfolderBase]: 747/4761 cut-off events. [2024-11-16 23:49:16,676 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-16 23:49:16,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5948 conditions, 4761 events. 747/4761 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 38308 event pairs, 571 based on Foata normal form. 0/4034 useless extension candidates. Maximal degree in co-relation 5791. Up to 1153 conditions per place. [2024-11-16 23:49:16,719 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 31 selfloop transitions, 1 changer transitions 0/380 dead transitions. [2024-11-16 23:49:16,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 380 transitions, 837 flow [2024-11-16 23:49:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2024-11-16 23:49:16,723 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069767441860465 [2024-11-16 23:49:16,724 INFO L175 Difference]: Start difference. First operand has 390 places, 387 transitions, 787 flow. Second operand 3 states and 1287 transitions. [2024-11-16 23:49:16,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 380 transitions, 837 flow [2024-11-16 23:49:16,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 380 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:16,730 INFO L231 Difference]: Finished difference. Result has 382 places, 380 transitions, 771 flow [2024-11-16 23:49:16,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=382, PETRI_TRANSITIONS=380} [2024-11-16 23:49:16,732 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -11 predicate places. [2024-11-16 23:49:16,732 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 380 transitions, 771 flow [2024-11-16 23:49:16,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:16,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:16,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:16,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:49:16,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:16,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:16,734 INFO L85 PathProgramCache]: Analyzing trace with hash 105041768, now seen corresponding path program 1 times [2024-11-16 23:49:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:16,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099237710] [2024-11-16 23:49:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:16,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099237710] [2024-11-16 23:49:16,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099237710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:16,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:16,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:16,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661582150] [2024-11-16 23:49:16,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:16,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:16,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 473 [2024-11-16 23:49:16,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 380 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:16,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:16,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 473 [2024-11-16 23:49:16,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:17,619 INFO L124 PetriNetUnfolderBase]: 685/4219 cut-off events. [2024-11-16 23:49:17,619 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-16 23:49:17,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5341 conditions, 4219 events. 685/4219 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 33633 event pairs, 541 based on Foata normal form. 0/3595 useless extension candidates. Maximal degree in co-relation 5184. Up to 1090 conditions per place. [2024-11-16 23:49:17,656 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 24 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2024-11-16 23:49:17,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 379 transitions, 821 flow [2024-11-16 23:49:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1317 transitions. [2024-11-16 23:49:17,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9281183932346723 [2024-11-16 23:49:17,660 INFO L175 Difference]: Start difference. First operand has 382 places, 380 transitions, 771 flow. Second operand 3 states and 1317 transitions. [2024-11-16 23:49:17,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 379 transitions, 821 flow [2024-11-16 23:49:17,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 379 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:49:17,666 INFO L231 Difference]: Finished difference. Result has 382 places, 379 transitions, 772 flow [2024-11-16 23:49:17,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=382, PETRI_TRANSITIONS=379} [2024-11-16 23:49:17,667 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -11 predicate places. [2024-11-16 23:49:17,667 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 379 transitions, 772 flow [2024-11-16 23:49:17,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:17,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:17,670 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:17,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:49:17,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:17,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1853515082, now seen corresponding path program 1 times [2024-11-16 23:49:17,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:17,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734116456] [2024-11-16 23:49:17,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:17,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:17,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:17,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734116456] [2024-11-16 23:49:17,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734116456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:17,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:17,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:17,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453471062] [2024-11-16 23:49:17,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:17,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:17,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:17,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:17,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 473 [2024-11-16 23:49:17,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 379 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:17,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:17,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 473 [2024-11-16 23:49:17,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:18,754 INFO L124 PetriNetUnfolderBase]: 835/4414 cut-off events. [2024-11-16 23:49:18,754 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-16 23:49:18,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5712 conditions, 4414 events. 835/4414 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 34101 event pairs, 605 based on Foata normal form. 0/3775 useless extension candidates. Maximal degree in co-relation 5555. Up to 1258 conditions per place. [2024-11-16 23:49:18,789 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 24 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-11-16 23:49:18,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 378 transitions, 822 flow [2024-11-16 23:49:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2024-11-16 23:49:18,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9260042283298098 [2024-11-16 23:49:18,793 INFO L175 Difference]: Start difference. First operand has 382 places, 379 transitions, 772 flow. Second operand 3 states and 1314 transitions. [2024-11-16 23:49:18,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 378 transitions, 822 flow [2024-11-16 23:49:18,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 378 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:18,799 INFO L231 Difference]: Finished difference. Result has 381 places, 378 transitions, 770 flow [2024-11-16 23:49:18,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=381, PETRI_TRANSITIONS=378} [2024-11-16 23:49:18,801 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -12 predicate places. [2024-11-16 23:49:18,801 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 378 transitions, 770 flow [2024-11-16 23:49:18,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:18,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:18,802 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:18,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:49:18,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:18,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2051721540, now seen corresponding path program 1 times [2024-11-16 23:49:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594047373] [2024-11-16 23:49:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594047373] [2024-11-16 23:49:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594047373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:18,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695340149] [2024-11-16 23:49:18,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:18,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:18,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:18,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:18,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 473 [2024-11-16 23:49:18,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 378 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:18,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:18,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 473 [2024-11-16 23:49:18,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:19,628 INFO L124 PetriNetUnfolderBase]: 991/4652 cut-off events. [2024-11-16 23:49:19,629 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-16 23:49:19,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6169 conditions, 4652 events. 991/4652 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 36678 event pairs, 713 based on Foata normal form. 0/3990 useless extension candidates. Maximal degree in co-relation 6012. Up to 1475 conditions per place. [2024-11-16 23:49:19,667 INFO L140 encePairwiseOnDemand]: 470/473 looper letters, 26 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-11-16 23:49:19,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 377 transitions, 824 flow [2024-11-16 23:49:19,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2024-11-16 23:49:19,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.923185341789993 [2024-11-16 23:49:19,670 INFO L175 Difference]: Start difference. First operand has 381 places, 378 transitions, 770 flow. Second operand 3 states and 1310 transitions. [2024-11-16 23:49:19,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 377 transitions, 824 flow [2024-11-16 23:49:19,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 820 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:19,677 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2024-11-16 23:49:19,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=380, PETRI_TRANSITIONS=377} [2024-11-16 23:49:19,678 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -13 predicate places. [2024-11-16 23:49:19,680 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2024-11-16 23:49:19,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:19,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:19,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:19,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:49:19,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1630607585, now seen corresponding path program 1 times [2024-11-16 23:49:19,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:19,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954928978] [2024-11-16 23:49:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:19,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:19,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:19,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954928978] [2024-11-16 23:49:19,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954928978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:19,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:19,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:19,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4176307] [2024-11-16 23:49:19,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:19,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:19,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:19,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:19,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:19,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 473 [2024-11-16 23:49:19,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:19,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:19,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 473 [2024-11-16 23:49:19,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:20,489 INFO L124 PetriNetUnfolderBase]: 1451/5174 cut-off events. [2024-11-16 23:49:20,489 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-16 23:49:20,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7368 conditions, 5174 events. 1451/5174 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 39688 event pairs, 507 based on Foata normal form. 0/4598 useless extension candidates. Maximal degree in co-relation 7212. Up to 2100 conditions per place. [2024-11-16 23:49:20,536 INFO L140 encePairwiseOnDemand]: 465/473 looper letters, 38 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2024-11-16 23:49:20,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 385 transitions, 871 flow [2024-11-16 23:49:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2024-11-16 23:49:20,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9182522903453136 [2024-11-16 23:49:20,540 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1303 transitions. [2024-11-16 23:49:20,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 385 transitions, 871 flow [2024-11-16 23:49:20,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 385 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:20,548 INFO L231 Difference]: Finished difference. Result has 376 places, 375 transitions, 775 flow [2024-11-16 23:49:20,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=376, PETRI_TRANSITIONS=375} [2024-11-16 23:49:20,550 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -17 predicate places. [2024-11-16 23:49:20,551 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 375 transitions, 775 flow [2024-11-16 23:49:20,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:20,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:20,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:49:20,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:20,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1136606378, now seen corresponding path program 1 times [2024-11-16 23:49:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:20,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291387834] [2024-11-16 23:49:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:20,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291387834] [2024-11-16 23:49:20,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291387834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:20,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:20,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:20,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851298279] [2024-11-16 23:49:20,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:20,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:20,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:20,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:20,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:20,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 473 [2024-11-16 23:49:20,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 375 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:20,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:20,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 473 [2024-11-16 23:49:20,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:21,659 INFO L124 PetriNetUnfolderBase]: 958/5613 cut-off events. [2024-11-16 23:49:21,659 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-16 23:49:21,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7294 conditions, 5613 events. 958/5613 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 48509 event pairs, 625 based on Foata normal form. 0/4986 useless extension candidates. Maximal degree in co-relation 7138. Up to 1485 conditions per place. [2024-11-16 23:49:21,706 INFO L140 encePairwiseOnDemand]: 467/473 looper letters, 30 selfloop transitions, 3 changer transitions 0/381 dead transitions. [2024-11-16 23:49:21,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 381 transitions, 853 flow [2024-11-16 23:49:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1320 transitions. [2024-11-16 23:49:21,711 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302325581395349 [2024-11-16 23:49:21,711 INFO L175 Difference]: Start difference. First operand has 376 places, 375 transitions, 775 flow. Second operand 3 states and 1320 transitions. [2024-11-16 23:49:21,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 381 transitions, 853 flow [2024-11-16 23:49:21,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:21,726 INFO L231 Difference]: Finished difference. Result has 376 places, 375 transitions, 790 flow [2024-11-16 23:49:21,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=376, PETRI_TRANSITIONS=375} [2024-11-16 23:49:21,728 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -17 predicate places. [2024-11-16 23:49:21,728 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 375 transitions, 790 flow [2024-11-16 23:49:21,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:21,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:21,729 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:21,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:49:21,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:21,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1067374685, now seen corresponding path program 1 times [2024-11-16 23:49:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:21,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092702854] [2024-11-16 23:49:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:21,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:21,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092702854] [2024-11-16 23:49:21,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092702854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:21,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:21,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126297424] [2024-11-16 23:49:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:21,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:21,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:21,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:21,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:21,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 473 [2024-11-16 23:49:21,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 375 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:21,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:21,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 473 [2024-11-16 23:49:21,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:23,362 INFO L124 PetriNetUnfolderBase]: 1809/8763 cut-off events. [2024-11-16 23:49:23,363 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-16 23:49:23,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11842 conditions, 8763 events. 1809/8763 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 78674 event pairs, 655 based on Foata normal form. 0/7593 useless extension candidates. Maximal degree in co-relation 11685. Up to 1443 conditions per place. [2024-11-16 23:49:23,415 INFO L140 encePairwiseOnDemand]: 462/473 looper letters, 44 selfloop transitions, 8 changer transitions 0/399 dead transitions. [2024-11-16 23:49:23,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 399 transitions, 948 flow [2024-11-16 23:49:23,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1333 transitions. [2024-11-16 23:49:23,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2024-11-16 23:49:23,419 INFO L175 Difference]: Start difference. First operand has 376 places, 375 transitions, 790 flow. Second operand 3 states and 1333 transitions. [2024-11-16 23:49:23,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 399 transitions, 948 flow [2024-11-16 23:49:23,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 399 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:23,425 INFO L231 Difference]: Finished difference. Result has 380 places, 383 transitions, 860 flow [2024-11-16 23:49:23,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=380, PETRI_TRANSITIONS=383} [2024-11-16 23:49:23,427 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -13 predicate places. [2024-11-16 23:49:23,428 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 383 transitions, 860 flow [2024-11-16 23:49:23,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:23,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:23,430 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:23,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:49:23,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:23,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash -163307582, now seen corresponding path program 1 times [2024-11-16 23:49:23,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:23,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242496731] [2024-11-16 23:49:23,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242496731] [2024-11-16 23:49:23,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242496731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:23,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046452675] [2024-11-16 23:49:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:23,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:23,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:23,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 473 [2024-11-16 23:49:23,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 383 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:23,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:23,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 473 [2024-11-16 23:49:23,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:25,017 INFO L124 PetriNetUnfolderBase]: 2111/10828 cut-off events. [2024-11-16 23:49:25,018 INFO L125 PetriNetUnfolderBase]: For 155/163 co-relation queries the response was YES. [2024-11-16 23:49:25,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14645 conditions, 10828 events. 2111/10828 cut-off events. For 155/163 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 103677 event pairs, 1244 based on Foata normal form. 0/9728 useless extension candidates. Maximal degree in co-relation 14486. Up to 2835 conditions per place. [2024-11-16 23:49:25,082 INFO L140 encePairwiseOnDemand]: 468/473 looper letters, 35 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-11-16 23:49:25,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 393 transitions, 957 flow [2024-11-16 23:49:25,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:25,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1315 transitions. [2024-11-16 23:49:25,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9267089499647639 [2024-11-16 23:49:25,086 INFO L175 Difference]: Start difference. First operand has 380 places, 383 transitions, 860 flow. Second operand 3 states and 1315 transitions. [2024-11-16 23:49:25,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 393 transitions, 957 flow [2024-11-16 23:49:25,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 393 transitions, 941 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:25,096 INFO L231 Difference]: Finished difference. Result has 378 places, 382 transitions, 852 flow [2024-11-16 23:49:25,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=378, PETRI_TRANSITIONS=382} [2024-11-16 23:49:25,098 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -15 predicate places. [2024-11-16 23:49:25,098 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 382 transitions, 852 flow [2024-11-16 23:49:25,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:25,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:25,099 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:25,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:49:25,100 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1102609131, now seen corresponding path program 1 times [2024-11-16 23:49:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:25,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875672004] [2024-11-16 23:49:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875672004] [2024-11-16 23:49:25,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875672004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:25,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:25,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101362952] [2024-11-16 23:49:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:25,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:25,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:25,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:25,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:25,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 473 [2024-11-16 23:49:25,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 382 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:25,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:25,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 473 [2024-11-16 23:49:25,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:28,210 INFO L124 PetriNetUnfolderBase]: 4584/20562 cut-off events. [2024-11-16 23:49:28,210 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2024-11-16 23:49:28,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29288 conditions, 20562 events. 4584/20562 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 221434 event pairs, 2480 based on Foata normal form. 0/18614 useless extension candidates. Maximal degree in co-relation 29128. Up to 5342 conditions per place. [2024-11-16 23:49:28,344 INFO L140 encePairwiseOnDemand]: 463/473 looper letters, 45 selfloop transitions, 9 changer transitions 0/405 dead transitions. [2024-11-16 23:49:28,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 405 transitions, 1012 flow [2024-11-16 23:49:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1333 transitions. [2024-11-16 23:49:28,349 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2024-11-16 23:49:28,349 INFO L175 Difference]: Start difference. First operand has 378 places, 382 transitions, 852 flow. Second operand 3 states and 1333 transitions. [2024-11-16 23:49:28,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 405 transitions, 1012 flow [2024-11-16 23:49:28,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 405 transitions, 1012 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:28,359 INFO L231 Difference]: Finished difference. Result has 382 places, 390 transitions, 922 flow [2024-11-16 23:49:28,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=922, PETRI_PLACES=382, PETRI_TRANSITIONS=390} [2024-11-16 23:49:28,361 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -11 predicate places. [2024-11-16 23:49:28,361 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 390 transitions, 922 flow [2024-11-16 23:49:28,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:28,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:28,363 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:28,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:49:28,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:28,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash -692849142, now seen corresponding path program 1 times [2024-11-16 23:49:28,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:28,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284220890] [2024-11-16 23:49:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:28,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284220890] [2024-11-16 23:49:28,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284220890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:28,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:28,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:49:28,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175313829] [2024-11-16 23:49:28,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:28,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:49:28,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:28,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:49:28,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:49:28,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 473 [2024-11-16 23:49:28,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 390 transitions, 922 flow. Second operand has 5 states, 5 states have (on average 430.8) internal successors, (2154), 5 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:28,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:28,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 473 [2024-11-16 23:49:28,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:31,345 INFO L124 PetriNetUnfolderBase]: 2538/15468 cut-off events. [2024-11-16 23:49:31,346 INFO L125 PetriNetUnfolderBase]: For 497/561 co-relation queries the response was YES. [2024-11-16 23:49:31,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21792 conditions, 15468 events. 2538/15468 cut-off events. For 497/561 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 167713 event pairs, 1887 based on Foata normal form. 4/14038 useless extension candidates. Maximal degree in co-relation 21628. Up to 3397 conditions per place. [2024-11-16 23:49:31,426 INFO L140 encePairwiseOnDemand]: 464/473 looper letters, 36 selfloop transitions, 8 changer transitions 0/404 dead transitions. [2024-11-16 23:49:31,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 404 transitions, 1037 flow [2024-11-16 23:49:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:49:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:49:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2619 transitions. [2024-11-16 23:49:31,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228329809725159 [2024-11-16 23:49:31,433 INFO L175 Difference]: Start difference. First operand has 382 places, 390 transitions, 922 flow. Second operand 6 states and 2619 transitions. [2024-11-16 23:49:31,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 404 transitions, 1037 flow [2024-11-16 23:49:31,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 404 transitions, 1019 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:31,444 INFO L231 Difference]: Finished difference. Result has 389 places, 394 transitions, 949 flow [2024-11-16 23:49:31,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=389, PETRI_TRANSITIONS=394} [2024-11-16 23:49:31,445 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -4 predicate places. [2024-11-16 23:49:31,445 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 394 transitions, 949 flow [2024-11-16 23:49:31,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 430.8) internal successors, (2154), 5 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:31,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:31,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:31,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:49:31,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:31,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1296751241, now seen corresponding path program 1 times [2024-11-16 23:49:31,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:31,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960795751] [2024-11-16 23:49:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:31,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:31,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960795751] [2024-11-16 23:49:31,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960795751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:31,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:31,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:31,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657908903] [2024-11-16 23:49:31,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:31,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:31,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:31,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:31,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 473 [2024-11-16 23:49:31,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 394 transitions, 949 flow. Second operand has 3 states, 3 states have (on average 438.6666666666667) internal successors, (1316), 3 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:31,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:31,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 473 [2024-11-16 23:49:31,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:34,357 INFO L124 PetriNetUnfolderBase]: 3409/17818 cut-off events. [2024-11-16 23:49:34,357 INFO L125 PetriNetUnfolderBase]: For 196/227 co-relation queries the response was YES. [2024-11-16 23:49:34,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25380 conditions, 17818 events. 3409/17818 cut-off events. For 196/227 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 195732 event pairs, 1915 based on Foata normal form. 2/15890 useless extension candidates. Maximal degree in co-relation 25212. Up to 3412 conditions per place. [2024-11-16 23:49:34,592 INFO L140 encePairwiseOnDemand]: 469/473 looper letters, 29 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2024-11-16 23:49:34,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 405 transitions, 1038 flow [2024-11-16 23:49:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1344 transitions. [2024-11-16 23:49:34,597 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9471458773784355 [2024-11-16 23:49:34,597 INFO L175 Difference]: Start difference. First operand has 389 places, 394 transitions, 949 flow. Second operand 3 states and 1344 transitions. [2024-11-16 23:49:34,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 405 transitions, 1038 flow [2024-11-16 23:49:34,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 405 transitions, 1034 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:49:34,606 INFO L231 Difference]: Finished difference. Result has 392 places, 396 transitions, 967 flow [2024-11-16 23:49:34,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=967, PETRI_PLACES=392, PETRI_TRANSITIONS=396} [2024-11-16 23:49:34,609 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, -1 predicate places. [2024-11-16 23:49:34,609 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 396 transitions, 967 flow [2024-11-16 23:49:34,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 438.6666666666667) internal successors, (1316), 3 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:34,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:34,611 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:34,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:49:34,611 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:34,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:34,612 INFO L85 PathProgramCache]: Analyzing trace with hash 679753423, now seen corresponding path program 1 times [2024-11-16 23:49:34,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:34,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787987991] [2024-11-16 23:49:34,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:34,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 23:49:35,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:35,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787987991] [2024-11-16 23:49:35,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787987991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:35,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:35,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:49:35,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523921843] [2024-11-16 23:49:35,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:35,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:49:35,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:35,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:49:35,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:49:35,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 473 [2024-11-16 23:49:35,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 396 transitions, 967 flow. Second operand has 6 states, 6 states have (on average 414.8333333333333) internal successors, (2489), 6 states have internal predecessors, (2489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:35,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:35,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 473 [2024-11-16 23:49:35,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:40,875 INFO L124 PetriNetUnfolderBase]: 9282/32181 cut-off events. [2024-11-16 23:49:40,875 INFO L125 PetriNetUnfolderBase]: For 2743/2856 co-relation queries the response was YES. [2024-11-16 23:49:41,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53919 conditions, 32181 events. 9282/32181 cut-off events. For 2743/2856 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 358918 event pairs, 4072 based on Foata normal form. 1/29208 useless extension candidates. Maximal degree in co-relation 53749. Up to 11398 conditions per place. [2024-11-16 23:49:41,107 INFO L140 encePairwiseOnDemand]: 459/473 looper letters, 97 selfloop transitions, 46 changer transitions 0/492 dead transitions. [2024-11-16 23:49:41,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 492 transitions, 1527 flow [2024-11-16 23:49:41,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:49:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:49:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2603 transitions. [2024-11-16 23:49:41,113 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9171952078928823 [2024-11-16 23:49:41,113 INFO L175 Difference]: Start difference. First operand has 392 places, 396 transitions, 967 flow. Second operand 6 states and 2603 transitions. [2024-11-16 23:49:41,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 492 transitions, 1527 flow [2024-11-16 23:49:41,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 492 transitions, 1521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:49:41,130 INFO L231 Difference]: Finished difference. Result has 399 places, 441 transitions, 1296 flow [2024-11-16 23:49:41,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1296, PETRI_PLACES=399, PETRI_TRANSITIONS=441} [2024-11-16 23:49:41,132 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, 6 predicate places. [2024-11-16 23:49:41,132 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 441 transitions, 1296 flow [2024-11-16 23:49:41,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 414.8333333333333) internal successors, (2489), 6 states have internal predecessors, (2489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:41,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:41,134 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:41,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:49:41,134 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:41,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1076608011, now seen corresponding path program 1 times [2024-11-16 23:49:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:41,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309258974] [2024-11-16 23:49:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:49:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:41,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309258974] [2024-11-16 23:49:41,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309258974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:41,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:41,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:49:41,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617694862] [2024-11-16 23:49:41,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:41,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:49:41,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:41,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:49:41,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:49:41,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 473 [2024-11-16 23:49:41,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 441 transitions, 1296 flow. Second operand has 5 states, 5 states have (on average 431.0) internal successors, (2155), 5 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:41,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:41,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 473 [2024-11-16 23:49:41,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:45,600 INFO L124 PetriNetUnfolderBase]: 5107/26953 cut-off events. [2024-11-16 23:49:45,600 INFO L125 PetriNetUnfolderBase]: For 2511/3813 co-relation queries the response was YES. [2024-11-16 23:49:45,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42315 conditions, 26953 events. 5107/26953 cut-off events. For 2511/3813 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 319517 event pairs, 2952 based on Foata normal form. 15/24599 useless extension candidates. Maximal degree in co-relation 42140. Up to 6460 conditions per place. [2024-11-16 23:49:45,820 INFO L140 encePairwiseOnDemand]: 464/473 looper letters, 27 selfloop transitions, 4 changer transitions 17/453 dead transitions. [2024-11-16 23:49:45,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 453 transitions, 1411 flow [2024-11-16 23:49:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:49:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:49:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2620 transitions. [2024-11-16 23:49:45,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.923185341789993 [2024-11-16 23:49:45,827 INFO L175 Difference]: Start difference. First operand has 399 places, 441 transitions, 1296 flow. Second operand 6 states and 2620 transitions. [2024-11-16 23:49:45,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 453 transitions, 1411 flow [2024-11-16 23:49:45,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 453 transitions, 1411 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:49:45,843 INFO L231 Difference]: Finished difference. Result has 406 places, 436 transitions, 1283 flow [2024-11-16 23:49:45,844 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1283, PETRI_PLACES=406, PETRI_TRANSITIONS=436} [2024-11-16 23:49:45,845 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, 13 predicate places. [2024-11-16 23:49:45,845 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 436 transitions, 1283 flow [2024-11-16 23:49:45,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 431.0) internal successors, (2155), 5 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:45,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:45,847 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:45,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:49:45,847 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:45,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash -791670576, now seen corresponding path program 1 times [2024-11-16 23:49:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:45,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632776129] [2024-11-16 23:49:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 23:49:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632776129] [2024-11-16 23:49:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632776129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 23:49:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93003908] [2024-11-16 23:49:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:46,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 23:49:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:46,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 23:49:46,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 23:49:46,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 473 [2024-11-16 23:49:46,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 436 transitions, 1283 flow. Second operand has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:46,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:46,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 473 [2024-11-16 23:49:46,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:53,759 INFO L124 PetriNetUnfolderBase]: 9948/40076 cut-off events. [2024-11-16 23:49:53,759 INFO L125 PetriNetUnfolderBase]: For 4709/6446 co-relation queries the response was YES. [2024-11-16 23:49:54,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68127 conditions, 40076 events. 9948/40076 cut-off events. For 4709/6446 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 483660 event pairs, 4798 based on Foata normal form. 216/36362 useless extension candidates. Maximal degree in co-relation 67947. Up to 11324 conditions per place. [2024-11-16 23:49:54,101 INFO L140 encePairwiseOnDemand]: 461/473 looper letters, 64 selfloop transitions, 14 changer transitions 10/485 dead transitions. [2024-11-16 23:49:54,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 485 transitions, 1566 flow [2024-11-16 23:49:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:49:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 23:49:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4308 transitions. [2024-11-16 23:49:54,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9107822410147992 [2024-11-16 23:49:54,109 INFO L175 Difference]: Start difference. First operand has 406 places, 436 transitions, 1283 flow. Second operand 10 states and 4308 transitions. [2024-11-16 23:49:54,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 485 transitions, 1566 flow [2024-11-16 23:49:54,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 485 transitions, 1534 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-16 23:49:54,154 INFO L231 Difference]: Finished difference. Result has 406 places, 443 transitions, 1322 flow [2024-11-16 23:49:54,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1322, PETRI_PLACES=406, PETRI_TRANSITIONS=443} [2024-11-16 23:49:54,155 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, 13 predicate places. [2024-11-16 23:49:54,155 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 443 transitions, 1322 flow [2024-11-16 23:49:54,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 424.0) internal successors, (2968), 7 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:54,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:54,157 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:54,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:49:54,157 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:54,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2114713789, now seen corresponding path program 1 times [2024-11-16 23:49:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:54,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162749939] [2024-11-16 23:49:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:54,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 23:49:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:54,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162749939] [2024-11-16 23:49:54,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162749939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:54,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:49:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378868453] [2024-11-16 23:49:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:54,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:49:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:54,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:49:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:49:54,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 473 [2024-11-16 23:49:54,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 443 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:54,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:49:54,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 473 [2024-11-16 23:49:54,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:49:55,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][360], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 438#L1034-1true, Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 484#(= |#race~flags_mutex~0| 0), 100#L1040-2true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:55,871 INFO L294 olderBase$Statistics]: this new event has 305 ancestors and is not cut-off event [2024-11-16 23:49:55,871 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is not cut-off event [2024-11-16 23:49:55,871 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is not cut-off event [2024-11-16 23:49:55,871 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is not cut-off event [2024-11-16 23:49:55,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, 316#L1066-6true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 484#(= |#race~flags_mutex~0| 0), 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:55,998 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-16 23:49:55,998 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-16 23:49:55,998 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-16 23:49:55,998 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-16 23:49:56,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,009 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,009 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,009 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,009 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, 29#L1043-4true, 316#L1066-6true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 484#(= |#race~flags_mutex~0| 0), 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,010 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,010 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,010 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,010 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), 81#L1043-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 296#L1066-4true, 463#true, Black: 482#true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,024 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,024 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,024 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,024 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 484#(= |#race~flags_mutex~0| 0), 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,025 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,025 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,025 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,025 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,026 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, 316#L1066-6true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0), 520#true]) [2024-11-16 23:49:56,026 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-16 23:49:56,026 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-16 23:49:56,026 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-16 23:49:56,026 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-16 23:49:56,026 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-16 23:49:56,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 296#L1066-4true, 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,290 INFO L294 olderBase$Statistics]: this new event has 324 ancestors and is cut-off event [2024-11-16 23:49:56,290 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-16 23:49:56,290 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-16 23:49:56,290 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-16 23:49:56,291 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0), 520#true]) [2024-11-16 23:49:56,291 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,291 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,292 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,292 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,292 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,292 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, 316#L1066-6true, 29#L1043-4true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 465#true, 438#L1034-1true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0), 520#true]) [2024-11-16 23:49:56,292 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,292 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,292 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,292 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,292 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,293 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, 316#L1066-6true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,294 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2024-11-16 23:49:56,294 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-16 23:49:56,294 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-16 23:49:56,294 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-16 23:49:56,294 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-16 23:49:56,294 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-16 23:49:56,313 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 296#L1066-4true, 463#true, Black: 482#true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 484#(= |#race~flags_mutex~0| 0), 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0), 520#true]) [2024-11-16 23:49:56,313 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,314 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,314 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,314 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,314 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,315 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 465#true, 438#L1034-1true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0), 520#true]) [2024-11-16 23:49:56,315 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,315 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,315 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,315 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,315 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,316 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,316 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,317 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,317 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,317 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,317 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,317 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,318 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, 29#L1043-4true, 316#L1066-6true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,318 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,318 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,318 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,318 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-16 23:49:56,318 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,319 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-16 23:49:56,340 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 296#L1066-4true, 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 484#(= |#race~flags_mutex~0| 0), 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0), 520#true]) [2024-11-16 23:49:56,340 INFO L294 olderBase$Statistics]: this new event has 324 ancestors and is cut-off event [2024-11-16 23:49:56,341 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-16 23:49:56,341 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-16 23:49:56,341 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2024-11-16 23:49:56,341 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-16 23:49:56,342 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 81#L1043-5true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 296#L1066-4true, 463#true, Black: 482#true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 438#L1034-1true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,342 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,343 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,343 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,343 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,343 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,343 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,344 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), 131#L1066-5true, Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 520#true, Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2024-11-16 23:49:56,344 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,344 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,344 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,344 INFO L297 olderBase$Statistics]: existing Event has 323 ancestors and is cut-off event [2024-11-16 23:49:56,344 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,344 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-16 23:49:56,367 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 296#L1066-4true, 463#true, Black: 482#true, 29#L1043-4true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 486#true, Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0), 520#true]) [2024-11-16 23:49:56,368 INFO L294 olderBase$Statistics]: this new event has 324 ancestors and is cut-off event [2024-11-16 23:49:56,368 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-16 23:49:56,368 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2024-11-16 23:49:56,368 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-16 23:49:56,368 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2024-11-16 23:49:56,368 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-16 23:49:57,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([951] L1034-2-->L1034-1: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][359], [Black: 517#(= |#race~data~0| 0), Black: 523#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 522#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 488#(= |#race~tids~0| 0), 472#(= |#race~threads_total~0| 0), 539#true, 232#L1066true, 463#true, Black: 482#true, Black: 543#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 551#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 486#true, 484#(= |#race~flags_mutex~0| 0), Black: 545#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 100#L1040-2true, 438#L1034-1true, 465#true, Black: 544#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 492#(= |#race~threads_alive~0| 0), 497#(= |#race~flags~0| 0), Black: 495#true, 556#true, Black: 501#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 506#(= |ULTIMATE.start_main_~i~2#1| 0), 520#true]) [2024-11-16 23:49:57,535 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-11-16 23:49:57,536 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-16 23:49:57,536 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-16 23:49:57,536 INFO L297 olderBase$Statistics]: existing Event has 369 ancestors and is cut-off event [2024-11-16 23:49:59,152 INFO L124 PetriNetUnfolderBase]: 6322/29229 cut-off events. [2024-11-16 23:49:59,152 INFO L125 PetriNetUnfolderBase]: For 3348/4970 co-relation queries the response was YES. [2024-11-16 23:49:59,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49706 conditions, 29229 events. 6322/29229 cut-off events. For 3348/4970 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 351574 event pairs, 3055 based on Foata normal form. 22/26812 useless extension candidates. Maximal degree in co-relation 49534. Up to 6468 conditions per place. [2024-11-16 23:49:59,322 INFO L140 encePairwiseOnDemand]: 468/473 looper letters, 32 selfloop transitions, 5 changer transitions 0/456 dead transitions. [2024-11-16 23:49:59,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 456 transitions, 1424 flow [2024-11-16 23:49:59,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:49:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:49:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1342 transitions. [2024-11-16 23:49:59,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9457364341085271 [2024-11-16 23:49:59,325 INFO L175 Difference]: Start difference. First operand has 406 places, 443 transitions, 1322 flow. Second operand 3 states and 1342 transitions. [2024-11-16 23:49:59,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 456 transitions, 1424 flow [2024-11-16 23:49:59,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 456 transitions, 1416 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 23:49:59,350 INFO L231 Difference]: Finished difference. Result has 406 places, 446 transitions, 1350 flow [2024-11-16 23:49:59,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=473, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=406, PETRI_TRANSITIONS=446} [2024-11-16 23:49:59,352 INFO L277 CegarLoopForPetriNet]: 393 programPoint places, 13 predicate places. [2024-11-16 23:49:59,352 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 446 transitions, 1350 flow [2024-11-16 23:49:59,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:49:59,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:49:59,353 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:49:59,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:49:59,353 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2024-11-16 23:49:59,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:49:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1145573001, now seen corresponding path program 1 times [2024-11-16 23:49:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:49:59,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688773409] [2024-11-16 23:49:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:49:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:49:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:49:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 23:49:59,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:49:59,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688773409] [2024-11-16 23:49:59,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688773409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:49:59,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:49:59,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 23:49:59,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537552091] [2024-11-16 23:49:59,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:49:59,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:49:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:49:59,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:49:59,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:50:00,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 473 [2024-11-16 23:50:00,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 446 transitions, 1350 flow. Second operand has 8 states, 8 states have (on average 418.875) internal successors, (3351), 8 states have internal predecessors, (3351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:50:00,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:50:00,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 473 [2024-11-16 23:50:00,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand