./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/weaver/popl20-bad-three-array-sum-alt.wvr.c -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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:13:51,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:13:51,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:13:51,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:13:51,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:13:51,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:13:51,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:13:51,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:13:51,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:13:51,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:13:51,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:13:51,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:13:51,947 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:13:51,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:13:51,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:13:51,947 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:13:51,948 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:13:51,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:51,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:13:51,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:13:51,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:13:51,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:13:51,950 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-03-17 11:13:52,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:13:52,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:13:52,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:13:52,218 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:13:52,218 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:13:52,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-17 11:13:53,389 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc35b2d4/c4daa9eaa3624daaa345061aed22a1cd/FLAG7eacb6e10 [2025-03-17 11:13:53,673 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:13:53,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-17 11:13:53,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc35b2d4/c4daa9eaa3624daaa345061aed22a1cd/FLAG7eacb6e10 [2025-03-17 11:13:53,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc35b2d4/c4daa9eaa3624daaa345061aed22a1cd [2025-03-17 11:13:53,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:13:53,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:13:53,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:53,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:13:53,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:13:53,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:53" (1/1) ... [2025-03-17 11:13:53,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3aa120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:53, skipping insertion in model container [2025-03-17 11:13:53,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:53" (1/1) ... [2025-03-17 11:13:53,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:13:54,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:54,107 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:13:54,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:54,149 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:13:54,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54 WrapperNode [2025-03-17 11:13:54,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:54,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:54,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:13:54,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:13:54,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,184 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 372 [2025-03-17 11:13:54,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:54,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:13:54,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:13:54,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:13:54,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:13:54,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:13:54,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:13:54,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:13:54,222 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (1/1) ... [2025-03-17 11:13:54,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:54,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:13:54,250 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) [2025-03-17 11:13:54,251 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 [2025-03-17 11:13:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:13:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:13:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:13:54,270 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:13:54,270 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:13:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:13:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:13:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:13:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:13:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:13:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:13:54,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:13:54,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:13:54,272 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:13:54,362 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:13:54,364 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:13:54,919 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:13:54,919 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:13:54,945 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:13:54,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:13:54,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:54 BoogieIcfgContainer [2025-03-17 11:13:54,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:13:54,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:13:54,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:13:54,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:13:54,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:13:53" (1/3) ... [2025-03-17 11:13:54,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd7168e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:54, skipping insertion in model container [2025-03-17 11:13:54,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:54" (2/3) ... [2025-03-17 11:13:54,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd7168e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:54, skipping insertion in model container [2025-03-17 11:13:54,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:54" (3/3) ... [2025-03-17 11:13:54,953 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-03-17 11:13:54,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:13:54,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 490 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2025-03-17 11:13:54,967 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:13:55,082 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:13:55,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 515 transitions, 1051 flow [2025-03-17 11:13:55,296 INFO L124 PetriNetUnfolderBase]: 26/512 cut-off events. [2025-03-17 11:13:55,298 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:13:55,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 512 events. 26/512 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 908 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 336. Up to 2 conditions per place. [2025-03-17 11:13:55,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 515 transitions, 1051 flow [2025-03-17 11:13:55,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 468 transitions, 954 flow [2025-03-17 11:13:55,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:13:55,335 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;@8cb1322, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:13:55,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-17 11:13:55,339 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:13:55,339 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-17 11:13:55,339 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:13:55,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:55,340 INFO L206 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] [2025-03-17 11:13:55,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:55,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1535995077, now seen corresponding path program 1 times [2025-03-17 11:13:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084337424] [2025-03-17 11:13:55,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:55,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:13:55,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:13:55,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:55,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:55,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:55,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084337424] [2025-03-17 11:13:55,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084337424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:55,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:55,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:55,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384853094] [2025-03-17 11:13:55,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:55,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:55,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:55,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:55,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:55,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 515 [2025-03-17 11:13:55,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 468 transitions, 954 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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) [2025-03-17 11:13:55,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:55,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 515 [2025-03-17 11:13:55,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:55,737 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2025-03-17 11:13:55,737 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 11:13:55,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1039 events. 33/1039 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5212 event pairs, 15 based on Foata normal form. 34/934 useless extension candidates. Maximal degree in co-relation 824. Up to 55 conditions per place. [2025-03-17 11:13:55,751 INFO L140 encePairwiseOnDemand]: 495/515 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2025-03-17 11:13:55,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2025-03-17 11:13:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-03-17 11:13:55,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2025-03-17 11:13:55,770 INFO L175 Difference]: Start difference. First operand has 455 places, 468 transitions, 954 flow. Second operand 3 states and 1460 transitions. [2025-03-17 11:13:55,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2025-03-17 11:13:55,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:13:55,788 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2025-03-17 11:13:55,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=450, PETRI_TRANSITIONS=444} [2025-03-17 11:13:55,795 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-03-17 11:13:55,795 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2025-03-17 11:13:55,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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) [2025-03-17 11:13:55,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:55,796 INFO L206 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] [2025-03-17 11:13:55,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:13:55,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:55,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash 929096332, now seen corresponding path program 1 times [2025-03-17 11:13:55,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:55,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183300403] [2025-03-17 11:13:55,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:55,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:55,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:13:55,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:13:55,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:55,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183300403] [2025-03-17 11:13:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183300403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:55,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:55,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422812152] [2025-03-17 11:13:55,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:55,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:55,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:55,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:55,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:55,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 515 [2025-03-17 11:13:55,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 444 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 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) [2025-03-17 11:13:55,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:55,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 515 [2025-03-17 11:13:55,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:56,234 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2025-03-17 11:13:56,234 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 11:13:56,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2658 events. 100/2658 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 19732 event pairs, 56 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 2797. Up to 152 conditions per place. [2025-03-17 11:13:56,251 INFO L140 encePairwiseOnDemand]: 508/515 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2025-03-17 11:13:56,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2025-03-17 11:13:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2025-03-17 11:13:56,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9268608414239482 [2025-03-17 11:13:56,254 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2025-03-17 11:13:56,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2025-03-17 11:13:56,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:56,261 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2025-03-17 11:13:56,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=438, PETRI_TRANSITIONS=438} [2025-03-17 11:13:56,262 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2025-03-17 11:13:56,262 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2025-03-17 11:13:56,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 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) [2025-03-17 11:13:56,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:56,263 INFO L206 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] [2025-03-17 11:13:56,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:13:56,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:56,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2054247356, now seen corresponding path program 1 times [2025-03-17 11:13:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:56,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893657982] [2025-03-17 11:13:56,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:56,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:56,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:13:56,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:13:56,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:56,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893657982] [2025-03-17 11:13:56,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893657982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:56,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484759648] [2025-03-17 11:13:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:56,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:56,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:56,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:57,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 515 [2025-03-17 11:13:57,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 438 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 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) [2025-03-17 11:13:57,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:57,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 515 [2025-03-17 11:13:57,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:57,903 INFO L124 PetriNetUnfolderBase]: 1199/6233 cut-off events. [2025-03-17 11:13:57,904 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-17 11:13:57,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8054 conditions, 6233 events. 1199/6233 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 54458 event pairs, 864 based on Foata normal form. 0/5379 useless extension candidates. Maximal degree in co-relation 8023. Up to 1772 conditions per place. [2025-03-17 11:13:57,977 INFO L140 encePairwiseOnDemand]: 497/515 looper letters, 54 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2025-03-17 11:13:57,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1016 flow [2025-03-17 11:13:57,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2025-03-17 11:13:57,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8427184466019417 [2025-03-17 11:13:57,982 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 6 states and 2604 transitions. [2025-03-17 11:13:57,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1016 flow [2025-03-17 11:13:57,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:57,988 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 907 flow [2025-03-17 11:13:57,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=907, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2025-03-17 11:13:57,989 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2025-03-17 11:13:57,989 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 907 flow [2025-03-17 11:13:57,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 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) [2025-03-17 11:13:57,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:57,991 INFO L206 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] [2025-03-17 11:13:57,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:13:57,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:57,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:57,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1486512300, now seen corresponding path program 1 times [2025-03-17 11:13:57,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:57,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113066823] [2025-03-17 11:13:57,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:58,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:13:58,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:13:58,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:58,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113066823] [2025-03-17 11:13:58,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113066823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:58,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:58,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212085302] [2025-03-17 11:13:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:58,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:58,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:58,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:58,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-03-17 11:13:58,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2025-03-17 11:13:58,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:58,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-03-17 11:13:58,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:58,116 INFO L124 PetriNetUnfolderBase]: 13/623 cut-off events. [2025-03-17 11:13:58,116 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:13:58,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 623 events. 13/623 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1670 event pairs, 5 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 638. Up to 22 conditions per place. [2025-03-17 11:13:58,122 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-03-17 11:13:58,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 931 flow [2025-03-17 11:13:58,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-17 11:13:58,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-03-17 11:13:58,125 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 907 flow. Second operand 3 states and 1451 transitions. [2025-03-17 11:13:58,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 931 flow [2025-03-17 11:13:58,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 434 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:13:58,131 INFO L231 Difference]: Finished difference. Result has 435 places, 434 transitions, 879 flow [2025-03-17 11:13:58,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=879, PETRI_PLACES=435, PETRI_TRANSITIONS=434} [2025-03-17 11:13:58,133 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -20 predicate places. [2025-03-17 11:13:58,133 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 434 transitions, 879 flow [2025-03-17 11:13:58,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2025-03-17 11:13:58,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:58,134 INFO L206 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] [2025-03-17 11:13:58,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:13:58,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:58,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1164307363, now seen corresponding path program 1 times [2025-03-17 11:13:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069412634] [2025-03-17 11:13:58,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:58,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 11:13:58,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 11:13:58,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:58,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:58,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069412634] [2025-03-17 11:13:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069412634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862454308] [2025-03-17 11:13:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:58,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:58,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:58,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:58,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-03-17 11:13:58,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 434 transitions, 879 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2025-03-17 11:13:58,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:58,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-03-17 11:13:58,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:58,291 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2025-03-17 11:13:58,291 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:13:58,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 563 events. 14/563 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1313 event pairs, 7 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 567. Up to 25 conditions per place. [2025-03-17 11:13:58,296 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-03-17 11:13:58,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 903 flow [2025-03-17 11:13:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-17 11:13:58,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-03-17 11:13:58,299 INFO L175 Difference]: Start difference. First operand has 435 places, 434 transitions, 879 flow. Second operand 3 states and 1451 transitions. [2025-03-17 11:13:58,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 903 flow [2025-03-17 11:13:58,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:58,305 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2025-03-17 11:13:58,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=434, PETRI_TRANSITIONS=433} [2025-03-17 11:13:58,306 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2025-03-17 11:13:58,306 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2025-03-17 11:13:58,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2025-03-17 11:13:58,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:58,307 INFO L206 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] [2025-03-17 11:13:58,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:13:58,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:58,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:58,307 INFO L85 PathProgramCache]: Analyzing trace with hash -488676939, now seen corresponding path program 1 times [2025-03-17 11:13:58,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:58,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373429462] [2025-03-17 11:13:58,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:58,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 11:13:58,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 11:13:58,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:58,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:58,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:58,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373429462] [2025-03-17 11:13:58,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373429462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:58,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:58,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12065703] [2025-03-17 11:13:58,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:58,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:58,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:58,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:58,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-03-17 11:13:58,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 433 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2025-03-17 11:13:58,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:58,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-03-17 11:13:58,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:58,460 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2025-03-17 11:13:58,460 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:13:58,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 440 events. 10/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 801 event pairs, 4 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 438. Up to 20 conditions per place. [2025-03-17 11:13:58,469 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-03-17 11:13:58,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2025-03-17 11:13:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-17 11:13:58,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-03-17 11:13:58,473 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2025-03-17 11:13:58,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2025-03-17 11:13:58,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:58,483 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2025-03-17 11:13:58,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=433, PETRI_TRANSITIONS=432} [2025-03-17 11:13:58,484 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2025-03-17 11:13:58,485 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2025-03-17 11:13:58,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2025-03-17 11:13:58,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:58,487 INFO L206 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] [2025-03-17 11:13:58,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:13:58,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:58,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1211296080, now seen corresponding path program 1 times [2025-03-17 11:13:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788086836] [2025-03-17 11:13:58,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:58,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:58,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 11:13:58,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 11:13:58,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:58,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:58,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:58,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788086836] [2025-03-17 11:13:58,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788086836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:58,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:58,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185652639] [2025-03-17 11:13:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:58,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:58,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:58,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:58,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:58,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-17 11:13:58,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 432 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 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) [2025-03-17 11:13:58,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:58,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-17 11:13:58,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:58,664 INFO L124 PetriNetUnfolderBase]: 15/547 cut-off events. [2025-03-17 11:13:58,664 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:13:58,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 547 events. 15/547 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1403 event pairs, 2 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 557. Up to 14 conditions per place. [2025-03-17 11:13:58,669 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2025-03-17 11:13:58,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2025-03-17 11:13:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2025-03-17 11:13:58,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9436893203883495 [2025-03-17 11:13:58,673 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2025-03-17 11:13:58,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2025-03-17 11:13:58,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:58,679 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2025-03-17 11:13:58,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=431, PETRI_TRANSITIONS=430} [2025-03-17 11:13:58,681 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2025-03-17 11:13:58,681 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2025-03-17 11:13:58,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 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) [2025-03-17 11:13:58,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:58,682 INFO L206 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] [2025-03-17 11:13:58,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:13:58,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:58,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash 119427921, now seen corresponding path program 1 times [2025-03-17 11:13:58,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:58,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745845051] [2025-03-17 11:13:58,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:58,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 11:13:58,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 11:13:58,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:58,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:58,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745845051] [2025-03-17 11:13:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745845051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:58,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:58,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149171264] [2025-03-17 11:13:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:58,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:58,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:58,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:58,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-17 11:13:58,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 430 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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) [2025-03-17 11:13:58,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:58,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-17 11:13:58,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:58,897 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2025-03-17 11:13:58,897 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:13:58,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1093 events. 31/1093 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4676 event pairs, 2 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1137. Up to 46 conditions per place. [2025-03-17 11:13:58,910 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-03-17 11:13:58,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2025-03-17 11:13:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2025-03-17 11:13:58,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946925566343042 [2025-03-17 11:13:58,917 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2025-03-17 11:13:58,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2025-03-17 11:13:58,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:58,926 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2025-03-17 11:13:58,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=430, PETRI_TRANSITIONS=430} [2025-03-17 11:13:58,927 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2025-03-17 11:13:58,927 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2025-03-17 11:13:58,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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) [2025-03-17 11:13:58,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:58,928 INFO L206 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] [2025-03-17 11:13:58,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:13:58,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:58,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash -986240563, now seen corresponding path program 1 times [2025-03-17 11:13:58,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:58,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933947674] [2025-03-17 11:13:58,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:58,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 11:13:58,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 11:13:58,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:58,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:58,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:58,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933947674] [2025-03-17 11:13:58,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933947674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:58,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:58,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:58,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940969040] [2025-03-17 11:13:58,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:58,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:58,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:58,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:58,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:58,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-17 11:13:59,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 430 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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) [2025-03-17 11:13:59,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:59,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-17 11:13:59,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:59,099 INFO L124 PetriNetUnfolderBase]: 25/750 cut-off events. [2025-03-17 11:13:59,099 INFO L125 PetriNetUnfolderBase]: For 12/33 co-relation queries the response was YES. [2025-03-17 11:13:59,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 750 events. 25/750 cut-off events. For 12/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2547 event pairs, 3 based on Foata normal form. 4/686 useless extension candidates. Maximal degree in co-relation 778. Up to 21 conditions per place. [2025-03-17 11:13:59,105 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2025-03-17 11:13:59,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2025-03-17 11:13:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2025-03-17 11:13:59,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943042071197411 [2025-03-17 11:13:59,107 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2025-03-17 11:13:59,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2025-03-17 11:13:59,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:13:59,112 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2025-03-17 11:13:59,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-03-17 11:13:59,113 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2025-03-17 11:13:59,113 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2025-03-17 11:13:59,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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) [2025-03-17 11:13:59,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:59,114 INFO L206 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] [2025-03-17 11:13:59,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:13:59,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:59,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:59,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1410625582, now seen corresponding path program 1 times [2025-03-17 11:13:59,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:59,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298101346] [2025-03-17 11:13:59,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:59,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:59,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 11:13:59,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 11:13:59,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:59,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298101346] [2025-03-17 11:13:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298101346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:59,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:59,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391636398] [2025-03-17 11:13:59,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:59,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:59,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:59,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:59,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-17 11:13:59,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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) [2025-03-17 11:13:59,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:59,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-17 11:13:59,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:59,334 INFO L124 PetriNetUnfolderBase]: 73/1869 cut-off events. [2025-03-17 11:13:59,334 INFO L125 PetriNetUnfolderBase]: For 25/29 co-relation queries the response was YES. [2025-03-17 11:13:59,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1869 events. 73/1869 cut-off events. For 25/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 11399 event pairs, 6 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 1989. Up to 93 conditions per place. [2025-03-17 11:13:59,350 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 15 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2025-03-17 11:13:59,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 915 flow [2025-03-17 11:13:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2025-03-17 11:13:59,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9462783171521035 [2025-03-17 11:13:59,353 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 3 states and 1462 transitions. [2025-03-17 11:13:59,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 915 flow [2025-03-17 11:13:59,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:59,358 INFO L231 Difference]: Finished difference. Result has 425 places, 424 transitions, 875 flow [2025-03-17 11:13:59,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=425, PETRI_TRANSITIONS=424} [2025-03-17 11:13:59,359 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -30 predicate places. [2025-03-17 11:13:59,359 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 424 transitions, 875 flow [2025-03-17 11:13:59,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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) [2025-03-17 11:13:59,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:59,360 INFO L206 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] [2025-03-17 11:13:59,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:13:59,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:13:59,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash 292622772, now seen corresponding path program 1 times [2025-03-17 11:13:59,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:59,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649719060] [2025-03-17 11:13:59,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:59,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:59,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 11:13:59,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 11:13:59,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:59,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:59,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649719060] [2025-03-17 11:13:59,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649719060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:59,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:59,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:13:59,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301373389] [2025-03-17 11:13:59,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:59,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:13:59,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:59,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:13:59,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:13:59,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-03-17 11:13:59,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 424 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 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) [2025-03-17 11:13:59,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:59,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-03-17 11:13:59,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:00,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1274] thread3EXIT-->L90-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 421#L90-17true]) [2025-03-17 11:14:00,093 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2025-03-17 11:14:00,093 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-17 11:14:00,093 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-17 11:14:00,093 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-17 11:14:00,094 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1274] thread3EXIT-->L90-17: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), Black: 533#true, 528#(= |#race~A~0| 0), 421#L90-17true]) [2025-03-17 11:14:00,094 INFO L294 olderBase$Statistics]: this new event has 308 ancestors and is not cut-off event [2025-03-17 11:14:00,094 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is not cut-off event [2025-03-17 11:14:00,094 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2025-03-17 11:14:00,094 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is not cut-off event [2025-03-17 11:14:00,094 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2025-03-17 11:14:00,107 INFO L124 PetriNetUnfolderBase]: 60/2025 cut-off events. [2025-03-17 11:14:00,107 INFO L125 PetriNetUnfolderBase]: For 13/62 co-relation queries the response was YES. [2025-03-17 11:14:00,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 2025 events. 60/2025 cut-off events. For 13/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10813 event pairs, 14 based on Foata normal form. 4/1859 useless extension candidates. Maximal degree in co-relation 2234. Up to 68 conditions per place. [2025-03-17 11:14:00,124 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2025-03-17 11:14:00,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 467 transitions, 1133 flow [2025-03-17 11:14:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:14:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:14:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-03-17 11:14:00,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-03-17 11:14:00,130 INFO L175 Difference]: Start difference. First operand has 425 places, 424 transitions, 875 flow. Second operand 10 states and 4633 transitions. [2025-03-17 11:14:00,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 467 transitions, 1133 flow [2025-03-17 11:14:00,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 467 transitions, 1133 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:00,135 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2025-03-17 11:14:00,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1067, PETRI_PLACES=438, PETRI_TRANSITIONS=449} [2025-03-17 11:14:00,136 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2025-03-17 11:14:00,136 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2025-03-17 11:14:00,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 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) [2025-03-17 11:14:00,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:00,137 INFO L206 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] [2025-03-17 11:14:00,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:14:00,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:00,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash -385143376, now seen corresponding path program 1 times [2025-03-17 11:14:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:00,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624724402] [2025-03-17 11:14:00,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:00,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 11:14:00,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:14:00,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:00,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:00,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624724402] [2025-03-17 11:14:00,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624724402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:00,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:00,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:00,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364572804] [2025-03-17 11:14:00,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:00,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:00,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:00,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:00,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:00,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-17 11:14:00,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 449 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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) [2025-03-17 11:14:00,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:00,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-17 11:14:00,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:00,413 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2025-03-17 11:14:00,414 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2025-03-17 11:14:00,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 2072 events. 102/2072 cut-off events. For 80/90 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 11413 event pairs, 2 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 2365. Up to 124 conditions per place. [2025-03-17 11:14:00,431 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2025-03-17 11:14:00,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2025-03-17 11:14:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-03-17 11:14:00,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2025-03-17 11:14:00,433 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2025-03-17 11:14:00,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2025-03-17 11:14:00,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:00,439 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2025-03-17 11:14:00,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=439, PETRI_TRANSITIONS=448} [2025-03-17 11:14:00,440 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2025-03-17 11:14:00,440 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2025-03-17 11:14:00,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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) [2025-03-17 11:14:00,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:00,441 INFO L206 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] [2025-03-17 11:14:00,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:14:00,441 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:00,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1833749583, now seen corresponding path program 1 times [2025-03-17 11:14:00,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:00,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089957190] [2025-03-17 11:14:00,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:00,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:00,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:14:00,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:14:00,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:00,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:00,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089957190] [2025-03-17 11:14:00,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089957190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:00,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:00,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:14:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572597399] [2025-03-17 11:14:00,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:00,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:14:00,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:00,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:14:00,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:14:00,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-03-17 11:14:00,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 448 transitions, 1070 flow. Second operand has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 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) [2025-03-17 11:14:00,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:00,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-03-17 11:14:00,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:01,063 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2025-03-17 11:14:01,063 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2025-03-17 11:14:01,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1499 events. 73/1499 cut-off events. For 103/173 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7135 event pairs, 28 based on Foata normal form. 4/1396 useless extension candidates. Maximal degree in co-relation 1803. Up to 99 conditions per place. [2025-03-17 11:14:01,080 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2025-03-17 11:14:01,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2025-03-17 11:14:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:14:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:14:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-03-17 11:14:01,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-03-17 11:14:01,086 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2025-03-17 11:14:01,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2025-03-17 11:14:01,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:01,092 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2025-03-17 11:14:01,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1175, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2025-03-17 11:14:01,094 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-03-17 11:14:01,094 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2025-03-17 11:14:01,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 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) [2025-03-17 11:14:01,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:01,095 INFO L206 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] [2025-03-17 11:14:01,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:14:01,096 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:01,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1349102828, now seen corresponding path program 1 times [2025-03-17 11:14:01,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:01,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71540747] [2025-03-17 11:14:01,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:01,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 11:14:01,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 11:14:01,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:01,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:01,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:01,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71540747] [2025-03-17 11:14:01,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71540747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:01,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:01,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:14:01,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175861585] [2025-03-17 11:14:01,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:01,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:14:01,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:01,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:14:01,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:14:01,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-03-17 11:14:01,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 1175 flow. Second operand has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 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) [2025-03-17 11:14:01,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:01,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-03-17 11:14:01,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:01,813 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2025-03-17 11:14:01,813 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2025-03-17 11:14:01,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1494 events. 72/1494 cut-off events. For 169/176 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6896 event pairs, 29 based on Foata normal form. 3/1401 useless extension candidates. Maximal degree in co-relation 1837. Up to 98 conditions per place. [2025-03-17 11:14:01,825 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2025-03-17 11:14:01,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2025-03-17 11:14:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:14:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 11:14:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-03-17 11:14:01,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-03-17 11:14:01,830 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2025-03-17 11:14:01,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2025-03-17 11:14:01,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 11:14:01,836 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2025-03-17 11:14:01,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1207, PETRI_PLACES=454, PETRI_TRANSITIONS=452} [2025-03-17 11:14:01,837 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2025-03-17 11:14:01,837 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2025-03-17 11:14:01,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 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) [2025-03-17 11:14:01,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:01,838 INFO L206 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] [2025-03-17 11:14:01,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:14:01,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:01,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:01,839 INFO L85 PathProgramCache]: Analyzing trace with hash -137610796, now seen corresponding path program 1 times [2025-03-17 11:14:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:01,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674622385] [2025-03-17 11:14:01,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:01,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 11:14:01,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 11:14:01,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:01,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:14:01,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:01,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674622385] [2025-03-17 11:14:01,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674622385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:01,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:01,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109638412] [2025-03-17 11:14:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:01,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:01,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:01,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:01,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:01,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-17 11:14:01,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 452 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 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) [2025-03-17 11:14:01,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:01,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-17 11:14:01,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:02,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1218] L68-23-->L68-21: Formula: (= |v_#race~csum~0_6| 0) InVars {} OutVars{#race~csum~0=|v_#race~csum~0_6|} AuxVars[] AssignedVars[#race~csum~0][403], [560#(= |#race~C~0| 0), Black: 568#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 602#(= |#race~csum~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 310#L68-21true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 581#true, 76#L88true, 562#true]) [2025-03-17 11:14:02,003 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-03-17 11:14:02,003 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-17 11:14:02,003 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-17 11:14:02,004 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-03-17 11:14:02,012 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2025-03-17 11:14:02,012 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2025-03-17 11:14:02,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1185 events. 48/1185 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4431 event pairs, 3 based on Foata normal form. 6/1127 useless extension candidates. Maximal degree in co-relation 1423. Up to 37 conditions per place. [2025-03-17 11:14:02,023 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2025-03-17 11:14:02,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2025-03-17 11:14:02,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2025-03-17 11:14:02,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943042071197411 [2025-03-17 11:14:02,026 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2025-03-17 11:14:02,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2025-03-17 11:14:02,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 11:14:02,032 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2025-03-17 11:14:02,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=447, PETRI_TRANSITIONS=422} [2025-03-17 11:14:02,033 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2025-03-17 11:14:02,034 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2025-03-17 11:14:02,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 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) [2025-03-17 11:14:02,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:02,034 INFO L206 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] [2025-03-17 11:14:02,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:14:02,034 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:02,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash -771129472, now seen corresponding path program 1 times [2025-03-17 11:14:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:02,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500457684] [2025-03-17 11:14:02,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:02,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 11:14:02,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 11:14:02,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:02,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:02,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:02,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500457684] [2025-03-17 11:14:02,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500457684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:02,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:02,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656084560] [2025-03-17 11:14:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:02,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:02,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:02,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:02,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-17 11:14:02,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 422 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 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) [2025-03-17 11:14:02,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:02,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-17 11:14:02,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:03,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 603#true, Black: 586#(<= ~N~0 0), 507#(= |#race~N~0| 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 528#(= |#race~A~0| 0), Black: 533#true, 76#L88true, 562#true]) [2025-03-17 11:14:03,143 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-03-17 11:14:03,143 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-17 11:14:03,143 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-17 11:14:03,143 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-17 11:14:03,285 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~N~0 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 603#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), Black: 533#true, 528#(= |#race~A~0| 0), 76#L88true, 562#true]) [2025-03-17 11:14:03,285 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-17 11:14:03,285 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-03-17 11:14:03,285 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-17 11:14:03,285 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-17 11:14:03,286 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-17 11:14:03,294 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2025-03-17 11:14:03,294 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2025-03-17 11:14:03,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 3554 events. 203/3554 cut-off events. For 56/77 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 25939 event pairs, 44 based on Foata normal form. 4/3276 useless extension candidates. Maximal degree in co-relation 4196. Up to 292 conditions per place. [2025-03-17 11:14:03,325 INFO L140 encePairwiseOnDemand]: 504/515 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2025-03-17 11:14:03,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2025-03-17 11:14:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2025-03-17 11:14:03,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915210355987055 [2025-03-17 11:14:03,329 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2025-03-17 11:14:03,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2025-03-17 11:14:03,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-03-17 11:14:03,335 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2025-03-17 11:14:03,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=443} [2025-03-17 11:14:03,336 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2025-03-17 11:14:03,336 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2025-03-17 11:14:03,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 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) [2025-03-17 11:14:03,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:03,337 INFO L206 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] [2025-03-17 11:14:03,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:14:03,337 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:03,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1342367619, now seen corresponding path program 1 times [2025-03-17 11:14:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145860949] [2025-03-17 11:14:03,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:03,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 11:14:03,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 11:14:03,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:03,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145860949] [2025-03-17 11:14:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145860949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:03,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:03,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076801225] [2025-03-17 11:14:03,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:03,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:03,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:03,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:03,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-17 11:14:03,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 443 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 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) [2025-03-17 11:14:03,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:03,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-17 11:14:03,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:05,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] L59-22-->L59-20: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][287], [281#L87true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, 560#(= |#race~C~0| 0), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 558#true, Black: 526#true, 183#L67-24true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 315#L59-20true, Black: 533#true]) [2025-03-17 11:14:05,128 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-03-17 11:14:05,128 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-17 11:14:05,128 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-17 11:14:05,128 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-17 11:14:05,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [281#L87true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 558#true, Black: 526#true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 335#L62true]) [2025-03-17 11:14:05,603 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2025-03-17 11:14:05,603 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-17 11:14:05,604 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-17 11:14:05,604 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-17 11:14:05,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 526#true, Black: 558#true, 603#true, 507#(= |#race~N~0| 0), Black: 533#true, 528#(= |#race~A~0| 0), 76#L88true]) [2025-03-17 11:14:05,635 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-17 11:14:05,635 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-17 11:14:05,635 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-17 11:14:05,635 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-17 11:14:05,763 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2025-03-17 11:14:05,764 INFO L125 PetriNetUnfolderBase]: For 1657/1739 co-relation queries the response was YES. [2025-03-17 11:14:05,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18895 conditions, 14868 events. 1328/14868 cut-off events. For 1657/1739 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 171737 event pairs, 205 based on Foata normal form. 0/13463 useless extension candidates. Maximal degree in co-relation 18855. Up to 1392 conditions per place. [2025-03-17 11:14:05,862 INFO L140 encePairwiseOnDemand]: 504/515 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2025-03-17 11:14:05,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2025-03-17 11:14:05,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2025-03-17 11:14:05,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915210355987055 [2025-03-17 11:14:05,866 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2025-03-17 11:14:05,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2025-03-17 11:14:05,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:05,876 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2025-03-17 11:14:05,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1903, PETRI_PLACES=444, PETRI_TRANSITIONS=528} [2025-03-17 11:14:05,877 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2025-03-17 11:14:05,877 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2025-03-17 11:14:05,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 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) [2025-03-17 11:14:05,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:05,878 INFO L206 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] [2025-03-17 11:14:05,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:14:05,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:05,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 643591904, now seen corresponding path program 1 times [2025-03-17 11:14:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:05,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134254820] [2025-03-17 11:14:05,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:05,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 11:14:05,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 11:14:05,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:05,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134254820] [2025-03-17 11:14:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134254820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:06,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:06,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869795081] [2025-03-17 11:14:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:06,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:06,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:06,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:06,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:06,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-17 11:14:06,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 528 transitions, 1903 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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) [2025-03-17 11:14:06,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:06,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-17 11:14:06,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:08,460 INFO L124 PetriNetUnfolderBase]: 1151/12311 cut-off events. [2025-03-17 11:14:08,460 INFO L125 PetriNetUnfolderBase]: For 3745/3855 co-relation queries the response was YES. [2025-03-17 11:14:08,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 12311 events. 1151/12311 cut-off events. For 3745/3855 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 136347 event pairs, 132 based on Foata normal form. 0/11312 useless extension candidates. Maximal degree in co-relation 17418. Up to 1063 conditions per place. [2025-03-17 11:14:08,573 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 106 selfloop transitions, 29 changer transitions 0/535 dead transitions. [2025-03-17 11:14:08,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 535 transitions, 2195 flow [2025-03-17 11:14:08,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2025-03-17 11:14:08,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080906148867314 [2025-03-17 11:14:08,577 INFO L175 Difference]: Start difference. First operand has 444 places, 528 transitions, 1903 flow. Second operand 6 states and 2806 transitions. [2025-03-17 11:14:08,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 535 transitions, 2195 flow [2025-03-17 11:14:08,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 535 transitions, 2195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:08,588 INFO L231 Difference]: Finished difference. Result has 448 places, 527 transitions, 1959 flow [2025-03-17 11:14:08,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1959, PETRI_PLACES=448, PETRI_TRANSITIONS=527} [2025-03-17 11:14:08,589 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -7 predicate places. [2025-03-17 11:14:08,589 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 527 transitions, 1959 flow [2025-03-17 11:14:08,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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) [2025-03-17 11:14:08,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:08,590 INFO L206 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] [2025-03-17 11:14:08,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:14:08,590 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:08,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1784121668, now seen corresponding path program 1 times [2025-03-17 11:14:08,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:08,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930820373] [2025-03-17 11:14:08,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:08,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:08,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 11:14:08,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 11:14:08,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:08,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:08,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:08,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930820373] [2025-03-17 11:14:08,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930820373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:08,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:08,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:08,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97312607] [2025-03-17 11:14:08,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:08,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:08,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:08,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:08,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:09,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-17 11:14:09,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 527 transitions, 1959 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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) [2025-03-17 11:14:09,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:09,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-17 11:14:09,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:10,734 INFO L124 PetriNetUnfolderBase]: 1146/12228 cut-off events. [2025-03-17 11:14:10,735 INFO L125 PetriNetUnfolderBase]: For 4436/4546 co-relation queries the response was YES. [2025-03-17 11:14:10,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 12228 events. 1146/12228 cut-off events. For 4436/4546 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 135037 event pairs, 132 based on Foata normal form. 0/11296 useless extension candidates. Maximal degree in co-relation 17812. Up to 1063 conditions per place. [2025-03-17 11:14:10,854 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 106 selfloop transitions, 29 changer transitions 0/534 dead transitions. [2025-03-17 11:14:10,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 534 transitions, 2251 flow [2025-03-17 11:14:10,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:10,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2025-03-17 11:14:10,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080906148867314 [2025-03-17 11:14:10,857 INFO L175 Difference]: Start difference. First operand has 448 places, 527 transitions, 1959 flow. Second operand 6 states and 2806 transitions. [2025-03-17 11:14:10,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 534 transitions, 2251 flow [2025-03-17 11:14:10,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 534 transitions, 2193 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:14:10,870 INFO L231 Difference]: Finished difference. Result has 447 places, 526 transitions, 1957 flow [2025-03-17 11:14:10,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1957, PETRI_PLACES=447, PETRI_TRANSITIONS=526} [2025-03-17 11:14:10,871 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2025-03-17 11:14:10,871 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 526 transitions, 1957 flow [2025-03-17 11:14:10,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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) [2025-03-17 11:14:10,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:10,872 INFO L206 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] [2025-03-17 11:14:10,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:14:10,872 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1296844273, now seen corresponding path program 1 times [2025-03-17 11:14:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835867090] [2025-03-17 11:14:10,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:10,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-17 11:14:10,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 11:14:10,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:10,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:10,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:10,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835867090] [2025-03-17 11:14:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835867090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409184261] [2025-03-17 11:14:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:10,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:10,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:10,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:10,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-17 11:14:10,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 526 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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) [2025-03-17 11:14:10,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:10,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-17 11:14:10,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:12,782 INFO L124 PetriNetUnfolderBase]: 884/10875 cut-off events. [2025-03-17 11:14:12,782 INFO L125 PetriNetUnfolderBase]: For 2302/2410 co-relation queries the response was YES. [2025-03-17 11:14:12,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14887 conditions, 10875 events. 884/10875 cut-off events. For 2302/2410 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 115949 event pairs, 71 based on Foata normal form. 1/10088 useless extension candidates. Maximal degree in co-relation 14842. Up to 727 conditions per place. [2025-03-17 11:14:12,924 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-03-17 11:14:12,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 527 transitions, 1985 flow [2025-03-17 11:14:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2025-03-17 11:14:12,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423948220064725 [2025-03-17 11:14:12,926 INFO L175 Difference]: Start difference. First operand has 447 places, 526 transitions, 1957 flow. Second operand 3 states and 1456 transitions. [2025-03-17 11:14:12,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 527 transitions, 1985 flow [2025-03-17 11:14:12,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 527 transitions, 1927 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:14:12,939 INFO L231 Difference]: Finished difference. Result has 443 places, 525 transitions, 1901 flow [2025-03-17 11:14:12,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=443, PETRI_TRANSITIONS=525} [2025-03-17 11:14:12,940 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -12 predicate places. [2025-03-17 11:14:12,940 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 525 transitions, 1901 flow [2025-03-17 11:14:12,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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) [2025-03-17 11:14:12,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:12,941 INFO L206 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] [2025-03-17 11:14:12,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:14:12,941 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:12,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1777964012, now seen corresponding path program 1 times [2025-03-17 11:14:12,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:12,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041372269] [2025-03-17 11:14:12,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:12,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:12,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 11:14:12,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 11:14:12,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:12,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:14:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041372269] [2025-03-17 11:14:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041372269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:12,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:12,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:14:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699414132] [2025-03-17 11:14:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:12,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:14:12,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:12,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:14:12,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:14:13,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-17 11:14:13,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 525 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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) [2025-03-17 11:14:13,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:13,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-17 11:14:13,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:14,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] L59-22-->L59-20: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][279], [281#L87true, 560#(= |#race~C~0| 0), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), 640#true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 526#true, Black: 558#true, 183#L67-24true, 637#true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 315#L59-20true, Black: 533#true]) [2025-03-17 11:14:14,311 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2025-03-17 11:14:14,311 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-17 11:14:14,311 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-17 11:14:14,311 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-17 11:14:14,474 INFO L124 PetriNetUnfolderBase]: 997/11923 cut-off events. [2025-03-17 11:14:14,475 INFO L125 PetriNetUnfolderBase]: For 1886/1987 co-relation queries the response was YES. [2025-03-17 11:14:14,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15866 conditions, 11923 events. 997/11923 cut-off events. For 1886/1987 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 131952 event pairs, 90 based on Foata normal form. 0/11080 useless extension candidates. Maximal degree in co-relation 15821. Up to 781 conditions per place. [2025-03-17 11:14:14,608 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2025-03-17 11:14:14,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 526 transitions, 1929 flow [2025-03-17 11:14:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:14:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:14:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2025-03-17 11:14:14,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423948220064725 [2025-03-17 11:14:14,610 INFO L175 Difference]: Start difference. First operand has 443 places, 525 transitions, 1901 flow. Second operand 3 states and 1456 transitions. [2025-03-17 11:14:14,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 526 transitions, 1929 flow [2025-03-17 11:14:14,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 526 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:14,621 INFO L231 Difference]: Finished difference. Result has 442 places, 524 transitions, 1899 flow [2025-03-17 11:14:14,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=442, PETRI_TRANSITIONS=524} [2025-03-17 11:14:14,622 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -13 predicate places. [2025-03-17 11:14:14,622 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 524 transitions, 1899 flow [2025-03-17 11:14:14,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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) [2025-03-17 11:14:14,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:14,623 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:14,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:14:14,623 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:14,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:14,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1504702710, now seen corresponding path program 1 times [2025-03-17 11:14:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:14,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613220947] [2025-03-17 11:14:14,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:14,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-17 11:14:14,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-17 11:14:14,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:14,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:14:15,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:15,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613220947] [2025-03-17 11:14:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613220947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:15,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:15,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:14:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301677642] [2025-03-17 11:14:15,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:15,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:14:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:15,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:14:15,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:14:15,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 515 [2025-03-17 11:14:15,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 524 transitions, 1899 flow. Second operand has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 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) [2025-03-17 11:14:15,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:15,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 515 [2025-03-17 11:14:15,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:19,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][535], [560#(= |#race~C~0| 0), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 224#L59-14true, 535#(= |#race~B~0| 0), 640#true, 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 275#L85-1true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 526#true, Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 603#true, 507#(= |#race~N~0| 0), Black: 533#true, 528#(= |#race~A~0| 0), 198#L51-14true]) [2025-03-17 11:14:19,783 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2025-03-17 11:14:19,783 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-17 11:14:19,783 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-17 11:14:19,783 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-17 11:14:19,910 INFO L124 PetriNetUnfolderBase]: 6087/33187 cut-off events. [2025-03-17 11:14:19,910 INFO L125 PetriNetUnfolderBase]: For 11989/12104 co-relation queries the response was YES. [2025-03-17 11:14:20,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55262 conditions, 33187 events. 6087/33187 cut-off events. For 11989/12104 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 406691 event pairs, 2256 based on Foata normal form. 0/31176 useless extension candidates. Maximal degree in co-relation 55216. Up to 8927 conditions per place. [2025-03-17 11:14:20,326 INFO L140 encePairwiseOnDemand]: 500/515 looper letters, 136 selfloop transitions, 77 changer transitions 0/584 dead transitions. [2025-03-17 11:14:20,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 584 transitions, 2629 flow [2025-03-17 11:14:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:14:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:14:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2749 transitions. [2025-03-17 11:14:20,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8896440129449839 [2025-03-17 11:14:20,330 INFO L175 Difference]: Start difference. First operand has 442 places, 524 transitions, 1899 flow. Second operand 6 states and 2749 transitions. [2025-03-17 11:14:20,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 584 transitions, 2629 flow [2025-03-17 11:14:20,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 584 transitions, 2625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:14:20,384 INFO L231 Difference]: Finished difference. Result has 450 places, 576 transitions, 2541 flow [2025-03-17 11:14:20,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2541, PETRI_PLACES=450, PETRI_TRANSITIONS=576} [2025-03-17 11:14:20,384 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-03-17 11:14:20,384 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 576 transitions, 2541 flow [2025-03-17 11:14:20,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 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) [2025-03-17 11:14:20,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:20,385 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:20,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:14:20,385 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:20,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1622418550, now seen corresponding path program 1 times [2025-03-17 11:14:20,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:20,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373520406] [2025-03-17 11:14:20,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:14:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:20,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 11:14:20,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 11:14:20,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:14:20,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:14:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373520406] [2025-03-17 11:14:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373520406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:21,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:21,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-17 11:14:21,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720410730] [2025-03-17 11:14:21,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:21,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:14:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:21,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:14:21,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:14:24,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 515 [2025-03-17 11:14:24,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 576 transitions, 2541 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 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) [2025-03-17 11:14:24,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:24,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 515 [2025-03-17 11:14:24,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:29,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1275] thread2EXIT-->L88: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 109#L67-26true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 76#L88true]) [2025-03-17 11:14:29,978 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-03-17 11:14:29,978 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-17 11:14:29,978 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-17 11:14:29,978 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-17 11:14:30,705 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1275] thread2EXIT-->L88: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 109#L67-26true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 76#L88true]) [2025-03-17 11:14:30,705 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2025-03-17 11:14:30,705 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-17 11:14:30,705 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-17 11:14:30,705 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-03-17 11:14:30,705 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-17 11:14:32,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][413], [560#(= |#race~C~0| 0), 47#L54true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, 275#L85-1true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 224#L59-14true, 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:14:32,927 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-03-17 11:14:32,927 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-17 11:14:32,927 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-17 11:14:32,927 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-17 11:14:33,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1170] L67-26-->L67-24: Formula: (= |v_#race~B~0_6| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_6|} AuxVars[] AssignedVars[#race~B~0][286], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, 275#L85-1true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), 183#L67-24true, Black: 526#true, 603#true, Black: 533#true, 315#L59-20true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 140#L50-2true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:14:33,023 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-03-17 11:14:33,023 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-17 11:14:33,023 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2025-03-17 11:14:33,023 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-17 11:14:33,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][413], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 281#L87true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 224#L59-14true, 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:14:33,161 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-03-17 11:14:33,161 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-03-17 11:14:33,161 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-03-17 11:14:33,161 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-03-17 11:14:34,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1210] L67-6-->L67-5: Formula: (= (store |v_#race_36| v_~C~0.base_11 (store (select |v_#race_36| v_~C~0.base_11) (+ 2 v_~C~0.offset_11 (* |v_thread3Thread1of1ForFork2_~i~2#1_43| 4)) |v_thread3Thread1of1ForFork2_#t~nondet12#1_7|)) |v_#race_35|) InVars {#race=|v_#race_36|, ~C~0.offset=v_~C~0.offset_11, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_43|} OutVars{#race=|v_#race_35|, ~C~0.offset=v_~C~0.offset_11, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_11, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_43|} AuxVars[] AssignedVars[#race][582], [560#(= |#race~C~0| 0), 302#L67-5true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, 275#L85-1true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 507#(= |#race~N~0| 0), 309#L58-2true, 528#(= |#race~A~0| 0), 198#L51-14true, 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2025-03-17 11:14:34,932 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2025-03-17 11:14:34,932 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-17 11:14:34,932 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-17 11:14:34,932 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-17 11:14:34,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 281#L87true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 199#L59-15true, 528#(= |#race~A~0| 0)]) [2025-03-17 11:14:34,955 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2025-03-17 11:14:34,956 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-17 11:14:34,956 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2025-03-17 11:14:34,956 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-17 11:14:34,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 47#L54true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, 275#L85-1true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 199#L59-15true, 528#(= |#race~A~0| 0)]) [2025-03-17 11:14:34,956 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2025-03-17 11:14:34,956 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-17 11:14:34,956 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-17 11:14:34,956 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-17 11:14:34,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1211] L67-5-->L67-3: Formula: (= (store |v_#race_34| v_~C~0.base_10 (store (select |v_#race_34| v_~C~0.base_10) (+ 3 v_~C~0.offset_10 (* |v_thread3Thread1of1ForFork2_~i~2#1_45| 4)) |v_thread3Thread1of1ForFork2_#t~nondet12#1_9|)) |v_#race_33|) InVars {#race=|v_#race_34|, ~C~0.offset=v_~C~0.offset_10, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_10, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_45|} OutVars{#race=|v_#race_33|, ~C~0.offset=v_~C~0.offset_10, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_10, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_45|} AuxVars[] AssignedVars[#race][600], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, 275#L85-1true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 507#(= |#race~N~0| 0), 309#L58-2true, 528#(= |#race~A~0| 0), 198#L51-14true, 413#L67-3true, 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2025-03-17 11:14:34,963 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2025-03-17 11:14:34,963 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-17 11:14:34,963 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-17 11:14:34,963 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-17 11:14:35,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][413], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 281#L87true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), 320#L67-7true, 53#L59-13true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:14:35,124 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2025-03-17 11:14:35,124 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2025-03-17 11:14:35,124 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-17 11:14:35,124 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-17 11:14:35,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][413], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 47#L54true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, 275#L85-1true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), 320#L67-7true, 53#L59-13true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:14:35,124 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2025-03-17 11:14:35,124 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-17 11:14:35,124 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-17 11:14:35,124 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-17 11:14:35,302 INFO L124 PetriNetUnfolderBase]: 8434/64694 cut-off events. [2025-03-17 11:14:35,302 INFO L125 PetriNetUnfolderBase]: For 49482/55630 co-relation queries the response was YES. [2025-03-17 11:14:35,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109718 conditions, 64694 events. 8434/64694 cut-off events. For 49482/55630 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 932784 event pairs, 1003 based on Foata normal form. 618/61365 useless extension candidates. Maximal degree in co-relation 109665. Up to 4505 conditions per place. [2025-03-17 11:14:36,165 INFO L140 encePairwiseOnDemand]: 480/515 looper letters, 541 selfloop transitions, 48 changer transitions 0/991 dead transitions. [2025-03-17 11:14:36,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 991 transitions, 7797 flow [2025-03-17 11:14:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 11:14:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-17 11:14:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 14207 transitions. [2025-03-17 11:14:36,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8359517505148573 [2025-03-17 11:14:36,172 INFO L175 Difference]: Start difference. First operand has 450 places, 576 transitions, 2541 flow. Second operand 33 states and 14207 transitions. [2025-03-17 11:14:36,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 991 transitions, 7797 flow [2025-03-17 11:14:36,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 991 transitions, 7761 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-17 11:14:36,415 INFO L231 Difference]: Finished difference. Result has 487 places, 596 transitions, 2736 flow [2025-03-17 11:14:36,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2736, PETRI_PLACES=487, PETRI_TRANSITIONS=596} [2025-03-17 11:14:36,416 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, 32 predicate places. [2025-03-17 11:14:36,416 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 596 transitions, 2736 flow [2025-03-17 11:14:36,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 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) [2025-03-17 11:14:36,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:14:36,418 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:14:36,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:14:36,419 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:14:36,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:14:36,420 INFO L85 PathProgramCache]: Analyzing trace with hash -670123484, now seen corresponding path program 2 times [2025-03-17 11:14:36,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:14:36,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40021551] [2025-03-17 11:14:36,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:14:36,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:14:36,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-03-17 11:14:36,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 11:14:36,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:14:36,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:14:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 11:14:38,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:14:38,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40021551] [2025-03-17 11:14:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40021551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:14:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:14:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-17 11:14:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120383537] [2025-03-17 11:14:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:14:38,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 11:14:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:14:38,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 11:14:38,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:14:45,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 515 [2025-03-17 11:14:45,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 596 transitions, 2736 flow. Second operand has 29 states, 29 states have (on average 364.58620689655174) internal successors, (10573), 29 states have internal predecessors, (10573), 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) [2025-03-17 11:14:45,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:14:45,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 515 [2025-03-17 11:14:45,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:14:48,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] L59-22-->L59-20: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][296], [560#(= |#race~C~0| 0), 47#L54true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 275#L85-1true, 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), 819#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (or (and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~C~0.base ~A~0.base))) (< ~N~0 0)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 526#true, 183#L67-24true, 603#true, 315#L59-20true, Black: 533#true, Black: 723#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:14:48,758 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2025-03-17 11:14:48,758 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-17 11:14:48,758 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-17 11:14:48,758 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-17 11:14:49,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] L59-22-->L59-20: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][296], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), 819#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (or (and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~C~0.base ~A~0.base))) (< ~N~0 0)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 526#true, 183#L67-24true, 603#true, 315#L59-20true, Black: 533#true, Black: 723#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 281#L87true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:14:49,240 INFO L294 olderBase$Statistics]: this new event has 314 ancestors and is cut-off event [2025-03-17 11:14:49,240 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-17 11:14:49,240 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-17 11:14:49,240 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-17 11:14:57,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1275] thread2EXIT-->L88: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][270], [278#L66-2true, 560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 817#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (or (not (= ~C~0.base ~A~0.base)) (< ~N~0 0)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 603#true, Black: 533#true, Black: 723#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 76#L88true]) [2025-03-17 11:14:57,554 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2025-03-17 11:14:57,554 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-17 11:14:57,554 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2025-03-17 11:14:57,554 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2025-03-17 11:14:58,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1275] thread2EXIT-->L88: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][270], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 817#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (or (not (= ~C~0.base ~A~0.base)) (< ~N~0 0)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 603#true, Black: 533#true, Black: 723#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 76#L88true, 380#L71true]) [2025-03-17 11:14:58,282 INFO L294 olderBase$Statistics]: this new event has 401 ancestors and is cut-off event [2025-03-17 11:14:58,282 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-17 11:14:58,282 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2025-03-17 11:14:58,282 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2025-03-17 11:14:59,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1275] thread2EXIT-->L88: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][270], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 109#L67-26true, 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 817#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (or (not (= ~C~0.base ~A~0.base)) (< ~N~0 0)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 603#true, Black: 533#true, Black: 723#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 76#L88true]) [2025-03-17 11:14:59,471 INFO L294 olderBase$Statistics]: this new event has 410 ancestors and is cut-off event [2025-03-17 11:14:59,471 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2025-03-17 11:14:59,471 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2025-03-17 11:14:59,471 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-03-17 11:15:04,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][896], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 275#L85-1true, Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 817#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (or (not (= ~C~0.base ~A~0.base)) (< ~N~0 0)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 603#true, Black: 533#true, Black: 723#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), 614#true, 8#L51-17true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 224#L59-14true, 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:15:04,421 INFO L294 olderBase$Statistics]: this new event has 449 ancestors and is cut-off event [2025-03-17 11:15:04,421 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2025-03-17 11:15:04,421 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2025-03-17 11:15:04,421 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is cut-off event [2025-03-17 11:15:04,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][888], [560#(= |#race~C~0| 0), 240#L51-16true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, 275#L85-1true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 817#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (or (not (= ~C~0.base ~A~0.base)) (< ~N~0 0)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 603#true, Black: 533#true, Black: 723#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 224#L59-14true, 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:15:04,464 INFO L294 olderBase$Statistics]: this new event has 450 ancestors and is cut-off event [2025-03-17 11:15:04,464 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2025-03-17 11:15:04,464 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2025-03-17 11:15:04,464 INFO L297 olderBase$Statistics]: existing Event has 405 ancestors and is cut-off event [2025-03-17 11:15:04,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][892], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, 275#L85-1true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 817#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (or (not (= ~C~0.base ~A~0.base)) (< ~N~0 0)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 603#true, Black: 533#true, Black: 723#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 223#L51-15true, Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 224#L59-14true, 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:15:04,508 INFO L294 olderBase$Statistics]: this new event has 451 ancestors and is cut-off event [2025-03-17 11:15:04,508 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2025-03-17 11:15:04,508 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2025-03-17 11:15:04,508 INFO L297 olderBase$Statistics]: existing Event has 406 ancestors and is cut-off event [2025-03-17 11:15:04,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1208] L67-8-->L67-7: Formula: (= (store |v_#race_40| v_~C~0.base_13 (store (select |v_#race_40| v_~C~0.base_13) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][903], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, 275#L85-1true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 817#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (or (not (= ~C~0.base ~A~0.base)) (< ~N~0 0)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 603#true, 236#L51-13true, Black: 533#true, Black: 723#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 727#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 725#(and (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 3 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* 4 |thread1Thread1of1ForFork1_~i~0#1|) ~A~0.offset 1)) 0)), 224#L59-14true, 535#(= |#race~B~0| 0), 320#L67-7true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* |thread2Thread1of1ForFork0_~i~1#1| 4) 1)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-17 11:15:04,552 INFO L294 olderBase$Statistics]: this new event has 452 ancestors and is cut-off event [2025-03-17 11:15:04,552 INFO L297 olderBase$Statistics]: existing Event has 407 ancestors and is cut-off event [2025-03-17 11:15:04,552 INFO L297 olderBase$Statistics]: existing Event has 407 ancestors and is cut-off event [2025-03-17 11:15:04,552 INFO L297 olderBase$Statistics]: existing Event has 407 ancestors and is cut-off event [2025-03-17 11:15:05,830 INFO L124 PetriNetUnfolderBase]: 14979/109705 cut-off events. [2025-03-17 11:15:05,830 INFO L125 PetriNetUnfolderBase]: For 97654/107982 co-relation queries the response was YES. [2025-03-17 11:15:07,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194955 conditions, 109705 events. 14979/109705 cut-off events. For 97654/107982 co-relation queries the response was YES. Maximal size of possible extension queue 1038. Compared 1660452 event pairs, 1974 based on Foata normal form. 429/103476 useless extension candidates. Maximal degree in co-relation 194894. Up to 8242 conditions per place. [2025-03-17 11:15:07,673 INFO L140 encePairwiseOnDemand]: 471/515 looper letters, 579 selfloop transitions, 82 changer transitions 0/1015 dead transitions. [2025-03-17 11:15:07,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 1015 transitions, 8364 flow [2025-03-17 11:15:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-17 11:15:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-17 11:15:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 13879 transitions. [2025-03-17 11:15:07,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7091977516607052 [2025-03-17 11:15:07,686 INFO L175 Difference]: Start difference. First operand has 487 places, 596 transitions, 2736 flow. Second operand 38 states and 13879 transitions. [2025-03-17 11:15:07,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 1015 transitions, 8364 flow [2025-03-17 11:15:08,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 1015 transitions, 8313 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-17 11:15:08,379 INFO L231 Difference]: Finished difference. Result has 503 places, 640 transitions, 3432 flow [2025-03-17 11:15:08,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=2685, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=3432, PETRI_PLACES=503, PETRI_TRANSITIONS=640} [2025-03-17 11:15:08,380 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, 48 predicate places. [2025-03-17 11:15:08,380 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 640 transitions, 3432 flow [2025-03-17 11:15:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 364.58620689655174) internal successors, (10573), 29 states have internal predecessors, (10573), 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) [2025-03-17 11:15:08,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:15:08,386 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:15:08,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:15:08,386 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-17 11:15:08,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:15:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1935055180, now seen corresponding path program 1 times [2025-03-17 11:15:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:15:08,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635913012] [2025-03-17 11:15:08,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:15:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:15:08,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 11:15:08,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 11:15:08,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:15:08,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat