./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 22:07:04,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:07:04,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:07:04,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:07:04,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:07:04,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:07:04,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:07:04,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:07:04,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:07:04,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:07:04,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:07:04,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:07:04,348 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:07:04,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:07:04,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:07:04,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:07:04,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:07:04,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:07:04,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:07:04,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:07:04,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:04,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:07:04,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:07:04,350 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:07:04,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:07:04,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:07:04,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:07:04,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:07:04,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:07:04,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:07:04,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:07:04,351 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-08 22:07:04,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:07:04,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:07:04,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:07:04,593 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:07:04,593 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:07:04,594 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-08 22:07:05,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163ae45cc/3905ca0462a74b08ac0bdbdc00e1c419/FLAG2c2a71773 [2025-03-08 22:07:05,981 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:07:05,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-08 22:07:05,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163ae45cc/3905ca0462a74b08ac0bdbdc00e1c419/FLAG2c2a71773 [2025-03-08 22:07:06,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163ae45cc/3905ca0462a74b08ac0bdbdc00e1c419 [2025-03-08 22:07:06,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:07:06,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:07:06,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:06,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:07:06,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:07:06,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4190e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06, skipping insertion in model container [2025-03-08 22:07:06,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:07:06,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:06,469 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:07:06,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:06,500 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:07:06,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06 WrapperNode [2025-03-08 22:07:06,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:06,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:06,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:07:06,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:07:06,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,548 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 372 [2025-03-08 22:07:06,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:06,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:07:06,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:07:06,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:07:06,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:07:06,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:07:06,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:07:06,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:07:06,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (1/1) ... [2025-03-08 22:07:06,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:06,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:07:06,635 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-08 22:07:06,638 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-08 22:07:06,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:07:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:07:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:07:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:07:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:07:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:07:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:07:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:07:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:07:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:07:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:07:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:07:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:07:06,662 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:07:06,756 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:07:06,758 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:07:07,310 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:07:07,311 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:07:07,327 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:07:07,327 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:07:07,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:07 BoogieIcfgContainer [2025-03-08 22:07:07,327 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:07:07,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:07:07,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:07:07,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:07:07,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:06" (1/3) ... [2025-03-08 22:07:07,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4f3748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:07, skipping insertion in model container [2025-03-08 22:07:07,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:06" (2/3) ... [2025-03-08 22:07:07,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4f3748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:07, skipping insertion in model container [2025-03-08 22:07:07,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:07" (3/3) ... [2025-03-08 22:07:07,336 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-03-08 22:07:07,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:07:07,348 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-08 22:07:07,348 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:07:07,488 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:07:07,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 515 transitions, 1051 flow [2025-03-08 22:07:07,700 INFO L124 PetriNetUnfolderBase]: 26/512 cut-off events. [2025-03-08 22:07:07,702 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:07:07,713 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 902 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-08 22:07:07,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 515 transitions, 1051 flow [2025-03-08 22:07:07,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 468 transitions, 954 flow [2025-03-08 22:07:07,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:07:07,736 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;@4f5b10b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:07:07,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-08 22:07:07,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:07:07,742 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 22:07:07,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:07:07,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:07,743 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-08 22:07:07,744 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-08 22:07:07,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash 38306877, now seen corresponding path program 1 times [2025-03-08 22:07:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:07,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501680291] [2025-03-08 22:07:07,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:07,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:07:07,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:07:07,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:07,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:07,885 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-08 22:07:07,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:07,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501680291] [2025-03-08 22:07:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501680291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:07,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:07,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168827491] [2025-03-08 22:07:07,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:07,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:07,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:07,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:07,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:07,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 515 [2025-03-08 22:07:07,962 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-08 22:07:07,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:07,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 515 [2025-03-08 22:07:07,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,151 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2025-03-08 22:07:08,151 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 22:07:08,164 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 23. Compared 5191 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-08 22:07:08,169 INFO L140 encePairwiseOnDemand]: 495/515 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2025-03-08 22:07:08,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2025-03-08 22:07:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-03-08 22:07:08,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2025-03-08 22:07:08,189 INFO L175 Difference]: Start difference. First operand has 455 places, 468 transitions, 954 flow. Second operand 3 states and 1460 transitions. [2025-03-08 22:07:08,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2025-03-08 22:07:08,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:07:08,244 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2025-03-08 22:07:08,247 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-08 22:07:08,251 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-03-08 22:07:08,251 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2025-03-08 22:07:08,252 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-08 22:07:08,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:08,252 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-08 22:07:08,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:07:08,252 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-08 22:07:08,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:08,253 INFO L85 PathProgramCache]: Analyzing trace with hash -419822197, now seen corresponding path program 1 times [2025-03-08 22:07:08,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:08,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569510448] [2025-03-08 22:07:08,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:08,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:08,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 22:07:08,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 22:07:08,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:08,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:08,296 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-08 22:07:08,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569510448] [2025-03-08 22:07:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569510448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:08,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:08,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021302943] [2025-03-08 22:07:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:08,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:08,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:08,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:08,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:08,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 515 [2025-03-08 22:07:08,326 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-08 22:07:08,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:08,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 515 [2025-03-08 22:07:08,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:08,675 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2025-03-08 22:07:08,675 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-08 22:07:08,688 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 19710 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-08 22:07:08,697 INFO L140 encePairwiseOnDemand]: 508/515 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2025-03-08 22:07:08,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2025-03-08 22:07:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2025-03-08 22:07:08,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9268608414239482 [2025-03-08 22:07:08,702 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2025-03-08 22:07:08,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2025-03-08 22:07:08,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:08,711 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2025-03-08 22:07:08,711 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-08 22:07:08,712 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2025-03-08 22:07:08,712 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2025-03-08 22:07:08,713 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-08 22:07:08,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:08,713 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-08 22:07:08,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:07:08,713 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-08 22:07:08,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1632594325, now seen corresponding path program 1 times [2025-03-08 22:07:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872739592] [2025-03-08 22:07:08,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:08,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:07:08,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:07:08,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:08,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:09,306 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-08 22:07:09,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872739592] [2025-03-08 22:07:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872739592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:09,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:09,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:09,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16455978] [2025-03-08 22:07:09,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:09,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:09,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:09,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:09,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 515 [2025-03-08 22:07:09,580 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-08 22:07:09,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:09,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 515 [2025-03-08 22:07:09,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:10,352 INFO L124 PetriNetUnfolderBase]: 1199/6236 cut-off events. [2025-03-08 22:07:10,352 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2025-03-08 22:07:10,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8056 conditions, 6236 events. 1199/6236 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 54480 event pairs, 864 based on Foata normal form. 0/5383 useless extension candidates. Maximal degree in co-relation 8025. Up to 1771 conditions per place. [2025-03-08 22:07:10,395 INFO L140 encePairwiseOnDemand]: 497/515 looper letters, 54 selfloop transitions, 15 changer transitions 0/435 dead transitions. [2025-03-08 22:07:10,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1016 flow [2025-03-08 22:07:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2025-03-08 22:07:10,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8427184466019417 [2025-03-08 22:07:10,400 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 6 states and 2604 transitions. [2025-03-08 22:07:10,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1016 flow [2025-03-08 22:07:10,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:10,405 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 907 flow [2025-03-08 22:07:10,406 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-08 22:07:10,407 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2025-03-08 22:07:10,407 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 907 flow [2025-03-08 22:07:10,408 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-08 22:07:10,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:10,408 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-08 22:07:10,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:07:10,408 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-08 22:07:10,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1422463777, now seen corresponding path program 1 times [2025-03-08 22:07:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:10,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548559035] [2025-03-08 22:07:10,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:10,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 22:07:10,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 22:07:10,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:10,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:10,446 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-08 22:07:10,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:10,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548559035] [2025-03-08 22:07:10,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548559035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:10,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:10,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:10,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200989944] [2025-03-08 22:07:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:10,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:10,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:10,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:10,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-03-08 22:07:10,464 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-08 22:07:10,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:10,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-03-08 22:07:10,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:10,524 INFO L124 PetriNetUnfolderBase]: 13/623 cut-off events. [2025-03-08 22:07:10,524 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:07:10,528 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 14. 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-08 22:07:10,531 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-03-08 22:07:10,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 931 flow [2025-03-08 22:07:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-08 22:07:10,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-03-08 22:07:10,535 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 907 flow. Second operand 3 states and 1451 transitions. [2025-03-08 22:07:10,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 931 flow [2025-03-08 22:07:10,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 434 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:07:10,540 INFO L231 Difference]: Finished difference. Result has 435 places, 434 transitions, 879 flow [2025-03-08 22:07:10,541 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-08 22:07:10,541 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -20 predicate places. [2025-03-08 22:07:10,542 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 434 transitions, 879 flow [2025-03-08 22:07:10,542 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-08 22:07:10,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:10,543 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-08 22:07:10,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:07:10,543 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-08 22:07:10,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash 863857740, now seen corresponding path program 1 times [2025-03-08 22:07:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:10,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523989308] [2025-03-08 22:07:10,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:10,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 22:07:10,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 22:07:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:10,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:10,581 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-08 22:07:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:10,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523989308] [2025-03-08 22:07:10,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523989308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:10,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:10,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:10,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961958406] [2025-03-08 22:07:10,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:10,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:10,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:10,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:10,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-03-08 22:07:10,596 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-08 22:07:10,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:10,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-03-08 22:07:10,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:10,647 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2025-03-08 22:07:10,648 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:07:10,651 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 11. Compared 1305 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-08 22:07:10,653 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-03-08 22:07:10,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 903 flow [2025-03-08 22:07:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-08 22:07:10,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-03-08 22:07:10,656 INFO L175 Difference]: Start difference. First operand has 435 places, 434 transitions, 879 flow. Second operand 3 states and 1451 transitions. [2025-03-08 22:07:10,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 903 flow [2025-03-08 22:07:10,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:10,661 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2025-03-08 22:07:10,662 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-08 22:07:10,662 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2025-03-08 22:07:10,662 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2025-03-08 22:07:10,663 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-08 22:07:10,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:10,663 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-08 22:07:10,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:07:10,664 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-08 22:07:10,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2004418844, now seen corresponding path program 1 times [2025-03-08 22:07:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479117142] [2025-03-08 22:07:10,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:10,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 22:07:10,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 22:07:10,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:10,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:10,741 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-08 22:07:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479117142] [2025-03-08 22:07:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479117142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:10,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:10,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791445854] [2025-03-08 22:07:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:10,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:10,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:10,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:10,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 515 [2025-03-08 22:07:10,761 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-08 22:07:10,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:10,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 515 [2025-03-08 22:07:10,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:10,830 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2025-03-08 22:07:10,830 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:07:10,833 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 8. Compared 797 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-08 22:07:10,834 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-03-08 22:07:10,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2025-03-08 22:07:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-08 22:07:10,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391585760517799 [2025-03-08 22:07:10,838 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2025-03-08 22:07:10,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2025-03-08 22:07:10,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:10,845 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2025-03-08 22:07:10,846 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-08 22:07:10,846 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2025-03-08 22:07:10,846 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2025-03-08 22:07:10,847 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-08 22:07:10,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:10,847 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-08 22:07:10,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:07:10,848 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-08 22:07:10,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:10,848 INFO L85 PathProgramCache]: Analyzing trace with hash 566168262, now seen corresponding path program 1 times [2025-03-08 22:07:10,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:10,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447289684] [2025-03-08 22:07:10,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:10,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 22:07:10,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 22:07:10,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:10,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:10,893 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-08 22:07:10,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:10,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447289684] [2025-03-08 22:07:10,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447289684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:10,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:10,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:10,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182118739] [2025-03-08 22:07:10,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:10,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:10,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:10,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:10,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-08 22:07:10,910 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-08 22:07:10,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:10,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-08 22:07:10,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:10,976 INFO L124 PetriNetUnfolderBase]: 14/694 cut-off events. [2025-03-08 22:07:10,976 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:07:10,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 694 events. 14/694 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1802 event pairs, 2 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 701. Up to 12 conditions per place. [2025-03-08 22:07:10,984 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2025-03-08 22:07:10,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2025-03-08 22:07:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2025-03-08 22:07:10,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9436893203883495 [2025-03-08 22:07:10,986 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2025-03-08 22:07:10,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2025-03-08 22:07:10,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:10,992 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2025-03-08 22:07:10,993 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-08 22:07:10,995 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2025-03-08 22:07:10,995 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2025-03-08 22:07:10,996 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-08 22:07:10,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:10,996 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-08 22:07:10,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:07:10,996 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-08 22:07:10,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:10,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1373114265, now seen corresponding path program 1 times [2025-03-08 22:07:10,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:10,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018367009] [2025-03-08 22:07:10,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:10,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:11,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 22:07:11,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 22:07:11,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:11,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:11,047 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-08 22:07:11,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:11,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018367009] [2025-03-08 22:07:11,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018367009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:11,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:11,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:11,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783093438] [2025-03-08 22:07:11,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:11,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:11,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:11,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:11,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:11,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-08 22:07:11,061 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-08 22:07:11,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:11,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-08 22:07:11,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:11,185 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2025-03-08 22:07:11,185 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-08 22:07:11,191 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 4660 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-08 22:07:11,194 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-03-08 22:07:11,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2025-03-08 22:07:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2025-03-08 22:07:11,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946925566343042 [2025-03-08 22:07:11,200 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2025-03-08 22:07:11,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2025-03-08 22:07:11,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:11,209 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2025-03-08 22:07:11,210 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-08 22:07:11,211 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2025-03-08 22:07:11,211 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2025-03-08 22:07:11,212 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-08 22:07:11,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:11,213 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-08 22:07:11,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:07:11,213 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-08 22:07:11,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:11,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1669764731, now seen corresponding path program 1 times [2025-03-08 22:07:11,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:11,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487831211] [2025-03-08 22:07:11,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:11,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:11,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 22:07:11,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 22:07:11,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:11,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:11,266 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-08 22:07:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:11,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487831211] [2025-03-08 22:07:11,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487831211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:11,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:11,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:11,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350843580] [2025-03-08 22:07:11,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:11,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:11,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:11,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:11,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-08 22:07:11,278 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-08 22:07:11,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:11,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-08 22:07:11,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:11,417 INFO L124 PetriNetUnfolderBase]: 24/944 cut-off events. [2025-03-08 22:07:11,417 INFO L125 PetriNetUnfolderBase]: For 10/28 co-relation queries the response was YES. [2025-03-08 22:07:11,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 944 events. 24/944 cut-off events. For 10/28 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3329 event pairs, 3 based on Foata normal form. 4/856 useless extension candidates. Maximal degree in co-relation 974. Up to 19 conditions per place. [2025-03-08 22:07:11,428 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2025-03-08 22:07:11,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2025-03-08 22:07:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2025-03-08 22:07:11,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943042071197411 [2025-03-08 22:07:11,431 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2025-03-08 22:07:11,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2025-03-08 22:07:11,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:11,438 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2025-03-08 22:07:11,439 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-08 22:07:11,439 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2025-03-08 22:07:11,439 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2025-03-08 22:07:11,440 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-08 22:07:11,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:11,440 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-08 22:07:11,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:07:11,441 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-08 22:07:11,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:11,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1538830762, now seen corresponding path program 1 times [2025-03-08 22:07:11,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:11,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925182586] [2025-03-08 22:07:11,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:11,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:11,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:07:11,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:07:11,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:11,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:11,601 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-08 22:07:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:11,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925182586] [2025-03-08 22:07:11,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925182586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:11,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:11,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:07:11,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675721451] [2025-03-08 22:07:11,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:11,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:07:11,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:11,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:07:11,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:07:11,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-03-08 22:07:11,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 869 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-08 22:07:11,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:11,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-03-08 22:07:11,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:12,089 INFO L124 PetriNetUnfolderBase]: 37/1068 cut-off events. [2025-03-08 22:07:12,090 INFO L125 PetriNetUnfolderBase]: For 7/31 co-relation queries the response was YES. [2025-03-08 22:07:12,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 1068 events. 37/1068 cut-off events. For 7/31 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3874 event pairs, 14 based on Foata normal form. 4/1006 useless extension candidates. Maximal degree in co-relation 1209. Up to 51 conditions per place. [2025-03-08 22:07:12,100 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2025-03-08 22:07:12,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 467 transitions, 1127 flow [2025-03-08 22:07:12,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:07:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:07:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-03-08 22:07:12,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-03-08 22:07:12,110 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 10 states and 4633 transitions. [2025-03-08 22:07:12,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 467 transitions, 1127 flow [2025-03-08 22:07:12,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 467 transitions, 1123 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:12,117 INFO L231 Difference]: Finished difference. Result has 437 places, 449 transitions, 1057 flow [2025-03-08 22:07:12,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=424, 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=1057, PETRI_PLACES=437, PETRI_TRANSITIONS=449} [2025-03-08 22:07:12,120 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -18 predicate places. [2025-03-08 22:07:12,120 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 449 transitions, 1057 flow [2025-03-08 22:07:12,122 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-08 22:07:12,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:12,122 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-08 22:07:12,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:07:12,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2025-03-08 22:07:12,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1673896710, now seen corresponding path program 1 times [2025-03-08 22:07:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:12,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426275223] [2025-03-08 22:07:12,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:12,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:07:12,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:07:12,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:12,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:12,171 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-08 22:07:12,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:12,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426275223] [2025-03-08 22:07:12,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426275223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:12,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:12,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:12,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371356519] [2025-03-08 22:07:12,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:12,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:12,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:12,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:12,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-08 22:07:12,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 449 transitions, 1057 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-08 22:07:12,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:12,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-08 22:07:12,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:12,486 INFO L124 PetriNetUnfolderBase]: 113/3049 cut-off events. [2025-03-08 22:07:12,486 INFO L125 PetriNetUnfolderBase]: For 59/63 co-relation queries the response was YES. [2025-03-08 22:07:12,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3356 conditions, 3049 events. 113/3049 cut-off events. For 59/63 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 19832 event pairs, 11 based on Foata normal form. 0/2759 useless extension candidates. Maximal degree in co-relation 3317. Up to 144 conditions per place. [2025-03-08 22:07:12,509 INFO L140 encePairwiseOnDemand]: 511/515 looper letters, 15 selfloop transitions, 2 changer transitions 0/453 dead transitions. [2025-03-08 22:07:12,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 453 transitions, 1103 flow [2025-03-08 22:07:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2025-03-08 22:07:12,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9462783171521035 [2025-03-08 22:07:12,511 INFO L175 Difference]: Start difference. First operand has 437 places, 449 transitions, 1057 flow. Second operand 3 states and 1462 transitions. [2025-03-08 22:07:12,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 453 transitions, 1103 flow [2025-03-08 22:07:12,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 453 transitions, 1103 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:12,517 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2025-03-08 22:07:12,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=515, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=438, PETRI_TRANSITIONS=449} [2025-03-08 22:07:12,518 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2025-03-08 22:07:12,518 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2025-03-08 22:07:12,519 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-08 22:07:12,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:12,519 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-08 22:07:12,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:07:12,519 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-08 22:07:12,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1507872942, now seen corresponding path program 1 times [2025-03-08 22:07:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:12,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126216039] [2025-03-08 22:07:12,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:12,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 22:07:12,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 22:07:12,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:12,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:12,555 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-08 22:07:12,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:12,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126216039] [2025-03-08 22:07:12,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126216039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:12,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:12,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950482636] [2025-03-08 22:07:12,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:12,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:12,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:12,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:12,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:12,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-08 22:07:12,564 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-08 22:07:12,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:12,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-08 22:07:12,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:12,777 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2025-03-08 22:07:12,778 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2025-03-08 22:07:12,791 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 11411 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-08 22:07:12,796 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2025-03-08 22:07:12,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2025-03-08 22:07:12,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:12,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2025-03-08 22:07:12,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449838187702265 [2025-03-08 22:07:12,799 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2025-03-08 22:07:12,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2025-03-08 22:07:12,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:12,806 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2025-03-08 22:07:12,806 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-08 22:07:12,807 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2025-03-08 22:07:12,807 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2025-03-08 22:07:12,808 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-08 22:07:12,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:12,808 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-08 22:07:12,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:07:12,808 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-08 22:07:12,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:12,809 INFO L85 PathProgramCache]: Analyzing trace with hash 56070121, now seen corresponding path program 1 times [2025-03-08 22:07:12,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:12,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232016134] [2025-03-08 22:07:12,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:12,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 22:07:12,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 22:07:12,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:12,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:12,951 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-08 22:07:12,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232016134] [2025-03-08 22:07:12,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232016134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:12,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:12,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:07:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655429580] [2025-03-08 22:07:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:07:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:12,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:07:12,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:07:13,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-03-08 22:07:13,151 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-08 22:07:13,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:13,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-03-08 22:07:13,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:13,401 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2025-03-08 22:07:13,402 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2025-03-08 22:07:13,413 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 7106 event pairs, 28 based on Foata normal form. 4/1395 useless extension candidates. Maximal degree in co-relation 1803. Up to 99 conditions per place. [2025-03-08 22:07:13,418 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2025-03-08 22:07:13,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2025-03-08 22:07:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:07:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:07:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-03-08 22:07:13,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-03-08 22:07:13,426 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2025-03-08 22:07:13,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2025-03-08 22:07:13,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:13,434 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2025-03-08 22:07:13,435 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-08 22:07:13,437 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-03-08 22:07:13,437 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2025-03-08 22:07:13,439 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-08 22:07:13,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:13,439 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-08 22:07:13,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:07:13,439 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-08 22:07:13,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash -87464138, now seen corresponding path program 1 times [2025-03-08 22:07:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524743135] [2025-03-08 22:07:13,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:13,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 22:07:13,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 22:07:13,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:13,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:13,585 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-08 22:07:13,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:13,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524743135] [2025-03-08 22:07:13,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524743135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:13,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:13,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:07:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861357021] [2025-03-08 22:07:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:13,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:07:13,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:13,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:07:13,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:07:13,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 515 [2025-03-08 22:07:13,869 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-08 22:07:13,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:13,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 515 [2025-03-08 22:07:13,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:14,099 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2025-03-08 22:07:14,099 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2025-03-08 22:07:14,109 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 6873 event pairs, 29 based on Foata normal form. 3/1400 useless extension candidates. Maximal degree in co-relation 1837. Up to 98 conditions per place. [2025-03-08 22:07:14,113 INFO L140 encePairwiseOnDemand]: 486/515 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2025-03-08 22:07:14,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2025-03-08 22:07:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:07:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:07:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2025-03-08 22:07:14,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8996116504854369 [2025-03-08 22:07:14,146 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2025-03-08 22:07:14,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2025-03-08 22:07:14,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 22:07:14,153 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2025-03-08 22:07:14,153 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-08 22:07:14,154 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2025-03-08 22:07:14,154 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2025-03-08 22:07:14,155 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-08 22:07:14,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:14,155 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-08 22:07:14,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:07:14,155 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-08 22:07:14,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash -915325476, now seen corresponding path program 1 times [2025-03-08 22:07:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787499062] [2025-03-08 22:07:14,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:14,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 22:07:14,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 22:07:14,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:14,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:14,202 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-08 22:07:14,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:14,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787499062] [2025-03-08 22:07:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787499062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:14,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:14,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178553114] [2025-03-08 22:07:14,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:14,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:14,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:14,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:14,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-08 22:07:14,213 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-08 22:07:14,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:14,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-08 22:07:14,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:14,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1227] L68-22-->L68-20: 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 (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), Black: 543#(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: 545#(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|)), 73#L68-20true, Black: 538#(<= ~N~0 0), Black: 539#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 602#(= |#race~csum~0| 0), Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 90#L88true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 581#true, 562#true]) [2025-03-08 22:07:14,329 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-03-08 22:07:14,329 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-08 22:07:14,330 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-03-08 22:07:14,330 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-03-08 22:07:14,339 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2025-03-08 22:07:14,340 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2025-03-08 22:07:14,347 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 4395 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-08 22:07:14,350 INFO L140 encePairwiseOnDemand]: 510/515 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2025-03-08 22:07:14,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2025-03-08 22:07:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2025-03-08 22:07:14,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.943042071197411 [2025-03-08 22:07:14,352 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2025-03-08 22:07:14,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2025-03-08 22:07:14,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 22:07:14,358 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2025-03-08 22:07:14,359 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-08 22:07:14,360 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2025-03-08 22:07:14,360 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2025-03-08 22:07:14,361 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-08 22:07:14,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:14,361 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-08 22:07:14,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:07:14,361 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-08 22:07:14,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1013055407, now seen corresponding path program 1 times [2025-03-08 22:07:14,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:14,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283177872] [2025-03-08 22:07:14,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:14,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:14,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 22:07:14,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 22:07:14,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:14,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:14,824 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-08 22:07:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283177872] [2025-03-08 22:07:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283177872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468462940] [2025-03-08 22:07:14,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:14,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:14,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:14,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:15,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-08 22:07:15,122 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-08 22:07:15,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:15,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-08 22:07:15,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:15,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), Black: 543#(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: 545#(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: 538#(<= ~N~0 0), Black: 539#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 600#true, Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 90#L88true, 603#true, Black: 586#(<= ~N~0 0), 507#(= |#race~N~0| 0), Black: 587#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~N~0 0)), 528#(= |#race~A~0| 0), 430#L67-7true, 562#true]) [2025-03-08 22:07:15,490 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-03-08 22:07:15,490 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-08 22:07:15,490 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-08 22:07:15,490 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-08 22:07:15,627 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), Black: 543#(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: 545#(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: 538#(<= ~N~0 0), Black: 539#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 600#true, Black: 554#true, Black: 526#true, Black: 558#true, 556#(= |#race~B~0| 0), 603#true, 90#L88true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 430#L67-7true, 562#true]) [2025-03-08 22:07:15,627 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-08 22:07:15,628 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-08 22:07:15,628 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-03-08 22:07:15,628 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-08 22:07:15,628 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-08 22:07:15,637 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2025-03-08 22:07:15,637 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2025-03-08 22:07:15,665 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 42. Compared 25962 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-08 22:07:15,674 INFO L140 encePairwiseOnDemand]: 504/515 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2025-03-08 22:07:15,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2025-03-08 22:07:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2025-03-08 22:07:15,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915210355987055 [2025-03-08 22:07:15,678 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2025-03-08 22:07:15,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2025-03-08 22:07:15,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-03-08 22:07:15,686 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2025-03-08 22:07:15,686 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-08 22:07:15,687 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2025-03-08 22:07:15,687 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2025-03-08 22:07:15,688 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-08 22:07:15,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:15,688 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-08 22:07:15,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:07:15,688 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-08 22:07:15,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:15,689 INFO L85 PathProgramCache]: Analyzing trace with hash 801998382, now seen corresponding path program 1 times [2025-03-08 22:07:15,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:15,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843357073] [2025-03-08 22:07:15,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:15,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:15,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 22:07:15,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 22:07:15,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:15,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:16,049 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-08 22:07:16,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843357073] [2025-03-08 22:07:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843357073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:16,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:16,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22783594] [2025-03-08 22:07:16,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:16,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:16,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:16,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:16,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-08 22:07:16,313 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-08 22:07:16,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:16,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-08 22:07:16,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:17,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L59-21-->L59-19: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][288], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 560#(= |#race~C~0| 0), 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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|)), 50#L59-19true, Black: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 74#L67-23true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-08 22:07:17,437 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-03-08 22:07:17,437 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-08 22:07:17,437 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2025-03-08 22:07:17,437 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-08 22:07:17,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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: 554#true, 155#L62true, Black: 526#true, Black: 558#true, 556#(= |#race~B~0| 0), 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 430#L67-7true]) [2025-03-08 22:07:17,812 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2025-03-08 22:07:17,812 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-08 22:07:17,812 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-08 22:07:17,812 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-08 22:07:17,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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: 554#true, Black: 558#true, Black: 526#true, 556#(= |#race~B~0| 0), 90#L88true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 430#L67-7true]) [2025-03-08 22:07:17,838 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-08 22:07:17,838 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-08 22:07:17,838 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-08 22:07:17,838 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-08 22:07:18,024 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2025-03-08 22:07:18,024 INFO L125 PetriNetUnfolderBase]: For 1655/1737 co-relation queries the response was YES. [2025-03-08 22:07:18,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18895 conditions, 14868 events. 1328/14868 cut-off events. For 1655/1737 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 172083 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-08 22:07:18,108 INFO L140 encePairwiseOnDemand]: 504/515 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2025-03-08 22:07:18,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2025-03-08 22:07:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2025-03-08 22:07:18,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.915210355987055 [2025-03-08 22:07:18,111 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2025-03-08 22:07:18,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2025-03-08 22:07:18,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:18,121 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2025-03-08 22:07:18,121 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-08 22:07:18,122 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2025-03-08 22:07:18,122 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2025-03-08 22:07:18,123 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-08 22:07:18,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:18,123 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-08 22:07:18,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:07:18,123 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-08 22:07:18,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1166223941, now seen corresponding path program 1 times [2025-03-08 22:07:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:18,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63320008] [2025-03-08 22:07:18,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:18,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:18,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 22:07:18,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 22:07:18,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:18,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:18,453 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-08 22:07:18,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:18,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63320008] [2025-03-08 22:07:18,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63320008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:18,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:18,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:18,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185618134] [2025-03-08 22:07:18,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:18,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:18,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:18,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:18,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:18,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-08 22:07:18,710 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-08 22:07:18,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:18,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-08 22:07:18,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:20,607 INFO L124 PetriNetUnfolderBase]: 1151/12311 cut-off events. [2025-03-08 22:07:20,607 INFO L125 PetriNetUnfolderBase]: For 3743/3853 co-relation queries the response was YES. [2025-03-08 22:07:20,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 12311 events. 1151/12311 cut-off events. For 3743/3853 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 136245 event pairs, 132 based on Foata normal form. 0/11311 useless extension candidates. Maximal degree in co-relation 17418. Up to 1063 conditions per place. [2025-03-08 22:07:20,688 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 106 selfloop transitions, 29 changer transitions 0/535 dead transitions. [2025-03-08 22:07:20,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 535 transitions, 2195 flow [2025-03-08 22:07:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2025-03-08 22:07:20,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080906148867314 [2025-03-08 22:07:20,691 INFO L175 Difference]: Start difference. First operand has 444 places, 528 transitions, 1903 flow. Second operand 6 states and 2806 transitions. [2025-03-08 22:07:20,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 535 transitions, 2195 flow [2025-03-08 22:07:20,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 535 transitions, 2195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:20,702 INFO L231 Difference]: Finished difference. Result has 448 places, 527 transitions, 1959 flow [2025-03-08 22:07:20,702 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-08 22:07:20,702 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -7 predicate places. [2025-03-08 22:07:20,702 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 527 transitions, 1959 flow [2025-03-08 22:07:20,703 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-08 22:07:20,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:20,703 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-08 22:07:20,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:07:20,704 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-08 22:07:20,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1944176225, now seen corresponding path program 1 times [2025-03-08 22:07:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685877099] [2025-03-08 22:07:20,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:20,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 22:07:20,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 22:07:20,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:20,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:21,037 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-08 22:07:21,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685877099] [2025-03-08 22:07:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685877099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:21,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:21,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:21,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992155796] [2025-03-08 22:07:21,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:21,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:21,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:21,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:21,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:21,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 515 [2025-03-08 22:07:21,291 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-08 22:07:21,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:21,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 515 [2025-03-08 22:07:21,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:22,748 INFO L124 PetriNetUnfolderBase]: 1146/12228 cut-off events. [2025-03-08 22:07:22,748 INFO L125 PetriNetUnfolderBase]: For 4434/4544 co-relation queries the response was YES. [2025-03-08 22:07:22,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 12228 events. 1146/12228 cut-off events. For 4434/4544 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 135258 event pairs, 132 based on Foata normal form. 0/11295 useless extension candidates. Maximal degree in co-relation 17812. Up to 1063 conditions per place. [2025-03-08 22:07:22,856 INFO L140 encePairwiseOnDemand]: 509/515 looper letters, 106 selfloop transitions, 29 changer transitions 0/534 dead transitions. [2025-03-08 22:07:22,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 534 transitions, 2251 flow [2025-03-08 22:07:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2025-03-08 22:07:22,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080906148867314 [2025-03-08 22:07:22,859 INFO L175 Difference]: Start difference. First operand has 448 places, 527 transitions, 1959 flow. Second operand 6 states and 2806 transitions. [2025-03-08 22:07:22,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 534 transitions, 2251 flow [2025-03-08 22:07:22,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 534 transitions, 2193 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:07:22,870 INFO L231 Difference]: Finished difference. Result has 447 places, 526 transitions, 1957 flow [2025-03-08 22:07:22,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-08 22:07:22,871 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2025-03-08 22:07:22,871 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 526 transitions, 1957 flow [2025-03-08 22:07:22,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-08 22:07:22,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:22,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-08 22:07:22,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:07:22,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-08 22:07:22,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:22,873 INFO L85 PathProgramCache]: Analyzing trace with hash 833842206, now seen corresponding path program 1 times [2025-03-08 22:07:22,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:22,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582141197] [2025-03-08 22:07:22,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:22,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 22:07:22,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 22:07:22,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:22,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:22,919 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-08 22:07:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:22,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582141197] [2025-03-08 22:07:22,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582141197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:22,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:22,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:22,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141584424] [2025-03-08 22:07:22,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:22,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:22,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:22,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:22,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-08 22:07:22,931 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-08 22:07:22,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:22,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-08 22:07:22,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:24,469 INFO L124 PetriNetUnfolderBase]: 980/13163 cut-off events. [2025-03-08 22:07:24,469 INFO L125 PetriNetUnfolderBase]: For 2584/2700 co-relation queries the response was YES. [2025-03-08 22:07:24,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17772 conditions, 13163 events. 980/13163 cut-off events. For 2584/2700 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 146360 event pairs, 79 based on Foata normal form. 1/12214 useless extension candidates. Maximal degree in co-relation 17727. Up to 848 conditions per place. [2025-03-08 22:07:24,550 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-03-08 22:07:24,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 527 transitions, 1985 flow [2025-03-08 22:07:24,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2025-03-08 22:07:24,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423948220064725 [2025-03-08 22:07:24,552 INFO L175 Difference]: Start difference. First operand has 447 places, 526 transitions, 1957 flow. Second operand 3 states and 1456 transitions. [2025-03-08 22:07:24,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 527 transitions, 1985 flow [2025-03-08 22:07:24,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 527 transitions, 1927 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:07:24,563 INFO L231 Difference]: Finished difference. Result has 443 places, 525 transitions, 1901 flow [2025-03-08 22:07:24,563 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-08 22:07:24,563 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -12 predicate places. [2025-03-08 22:07:24,564 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 525 transitions, 1901 flow [2025-03-08 22:07:24,564 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-08 22:07:24,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:24,564 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-08 22:07:24,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:07:24,564 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-08 22:07:24,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1352829699, now seen corresponding path program 1 times [2025-03-08 22:07:24,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:24,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809721843] [2025-03-08 22:07:24,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:24,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 22:07:24,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 22:07:24,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:24,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:24,607 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-08 22:07:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809721843] [2025-03-08 22:07:24,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809721843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:24,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:24,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670103887] [2025-03-08 22:07:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:24,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:24,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:24,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:24,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:24,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 515 [2025-03-08 22:07:24,619 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-08 22:07:24,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:24,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 515 [2025-03-08 22:07:24,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:26,563 INFO L124 PetriNetUnfolderBase]: 1055/13325 cut-off events. [2025-03-08 22:07:26,564 INFO L125 PetriNetUnfolderBase]: For 2010/2135 co-relation queries the response was YES. [2025-03-08 22:07:26,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17599 conditions, 13325 events. 1055/13325 cut-off events. For 2010/2135 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 149986 event pairs, 101 based on Foata normal form. 1/12389 useless extension candidates. Maximal degree in co-relation 17554. Up to 858 conditions per place. [2025-03-08 22:07:26,687 INFO L140 encePairwiseOnDemand]: 512/515 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2025-03-08 22:07:26,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 526 transitions, 1929 flow [2025-03-08 22:07:26,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2025-03-08 22:07:26,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423948220064725 [2025-03-08 22:07:26,690 INFO L175 Difference]: Start difference. First operand has 443 places, 525 transitions, 1901 flow. Second operand 3 states and 1456 transitions. [2025-03-08 22:07:26,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 526 transitions, 1929 flow [2025-03-08 22:07:26,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 526 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:26,703 INFO L231 Difference]: Finished difference. Result has 442 places, 524 transitions, 1899 flow [2025-03-08 22:07:26,703 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-08 22:07:26,704 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -13 predicate places. [2025-03-08 22:07:26,704 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 524 transitions, 1899 flow [2025-03-08 22:07:26,704 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-08 22:07:26,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:26,704 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-08 22:07:26,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:07:26,705 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-08 22:07:26,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1995480872, now seen corresponding path program 1 times [2025-03-08 22:07:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:26,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011996893] [2025-03-08 22:07:26,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:26,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:26,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-08 22:07:26,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-08 22:07:26,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:26,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:27,256 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-08 22:07:27,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:27,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011996893] [2025-03-08 22:07:27,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011996893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812224591] [2025-03-08 22:07:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:27,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:27,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:27,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:27,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:27,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 515 [2025-03-08 22:07:27,428 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-08 22:07:27,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:27,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 515 [2025-03-08 22:07:27,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:31,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][535], [614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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|)), 640#true, Black: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 526#true, Black: 558#true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 603#true, 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 430#L67-7true, 93#L59-13true, 202#L51-13true]) [2025-03-08 22:07:31,576 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2025-03-08 22:07:31,576 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-08 22:07:31,576 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-08 22:07:31,576 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-08 22:07:31,668 INFO L124 PetriNetUnfolderBase]: 6087/33196 cut-off events. [2025-03-08 22:07:31,668 INFO L125 PetriNetUnfolderBase]: For 11989/12104 co-relation queries the response was YES. [2025-03-08 22:07:31,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55272 conditions, 33196 events. 6087/33196 cut-off events. For 11989/12104 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 407210 event pairs, 2256 based on Foata normal form. 0/31183 useless extension candidates. Maximal degree in co-relation 55226. Up to 8926 conditions per place. [2025-03-08 22:07:32,000 INFO L140 encePairwiseOnDemand]: 500/515 looper letters, 136 selfloop transitions, 77 changer transitions 0/584 dead transitions. [2025-03-08 22:07:32,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 584 transitions, 2629 flow [2025-03-08 22:07:32,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2749 transitions. [2025-03-08 22:07:32,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8896440129449839 [2025-03-08 22:07:32,004 INFO L175 Difference]: Start difference. First operand has 442 places, 524 transitions, 1899 flow. Second operand 6 states and 2749 transitions. [2025-03-08 22:07:32,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 584 transitions, 2629 flow [2025-03-08 22:07:32,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 584 transitions, 2625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:32,057 INFO L231 Difference]: Finished difference. Result has 450 places, 576 transitions, 2541 flow [2025-03-08 22:07:32,057 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-08 22:07:32,058 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2025-03-08 22:07:32,058 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 576 transitions, 2541 flow [2025-03-08 22:07:32,058 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-08 22:07:32,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:32,058 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-08 22:07:32,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:07:32,059 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-08 22:07:32,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1258043841, now seen corresponding path program 1 times [2025-03-08 22:07:32,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:32,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151781302] [2025-03-08 22:07:32,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:32,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 22:07:32,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 22:07:32,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:32,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:33,700 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-08 22:07:33,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:33,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151781302] [2025-03-08 22:07:33,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151781302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:33,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:33,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 22:07:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426850841] [2025-03-08 22:07:33,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:33,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:07:33,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:33,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:07:33,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:07:36,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 515 [2025-03-08 22:07:36,536 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-08 22:07:36,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:36,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 515 [2025-03-08 22:07:36,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:43,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1284] thread2EXIT-->L88: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 90#L88true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 253#L67-25true, 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)), 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-08 22:07:43,119 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-03-08 22:07:43,119 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-08 22:07:43,119 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-08 22:07:43,119 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-08 22:07:43,601 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1284] thread2EXIT-->L88: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 90#L88true, 603#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 253#L67-25true, 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, 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-08 22:07:43,601 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2025-03-08 22:07:43,601 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-08 22:07:43,601 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-03-08 22:07:43,601 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-08 22:07:43,602 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-08 22:07:45,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 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)), 115#L54true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-03-08 22:07:45,528 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-03-08 22:07:45,528 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-08 22:07:45,528 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-08 22:07:45,528 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2025-03-08 22:07:45,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1179] L67-25-->L67-23: Formula: (= |v_#race~B~0_6| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_6|} AuxVars[] AssignedVars[#race~B~0][287], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 50#L59-19true, 66#L50-2true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 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, 556#(= |#race~B~0| 0), 74#L67-23true, 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0)]) [2025-03-08 22:07:45,599 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-03-08 22:07:45,599 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-08 22:07:45,599 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2025-03-08 22:07:45,599 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-08 22:07:45,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 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, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 93#L59-13true]) [2025-03-08 22:07:45,927 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-03-08 22:07:45,927 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-03-08 22:07:45,927 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-03-08 22:07:45,927 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-03-08 22:07:47,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1219] L67-6-->L67-5: Formula: (= (store |v_#race_36| v_~C~0.base_11 (store (select |v_#race_36| v_~C~0.base_11) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_43| 4) 2 v_~C~0.offset_11) |v_thread3Thread1of1ForFork0_#t~nondet12#1_7|)) |v_#race_35|) InVars {#race=|v_#race_36|, ~C~0.offset=v_~C~0.offset_11, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_43|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_11} OutVars{#race=|v_#race_35|, ~C~0.offset=v_~C~0.offset_11, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_43|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_11} AuxVars[] AssignedVars[#race][579], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 165#L58-2true, 202#L51-13true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), 311#L67-5true, Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 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)) (= |thread1Thread1of1ForFork2_~i~0#1| 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) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2025-03-08 22:07:47,575 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2025-03-08 22:07:47,575 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-08 22:07:47,575 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-08 22:07:47,575 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-08 22:07:47,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1220] L67-5-->L67-3: Formula: (= (store |v_#race_34| v_~C~0.base_10 (store (select |v_#race_34| v_~C~0.base_10) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_45| 4) 3 v_~C~0.offset_10) |v_thread3Thread1of1ForFork0_#t~nondet12#1_9|)) |v_#race_33|) InVars {#race=|v_#race_34|, ~C~0.offset=v_~C~0.offset_10, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_45|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_10} OutVars{#race=|v_#race_33|, ~C~0.offset=v_~C~0.offset_10, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_45|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_10} AuxVars[] AssignedVars[#race][597], [560#(= |#race~C~0| 0), 493#L67-3true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 165#L58-2true, 202#L51-13true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 556#(= |#race~B~0| 0), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 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)) (= |thread1Thread1of1ForFork2_~i~0#1| 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) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2025-03-08 22:07:47,612 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2025-03-08 22:07:47,612 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-08 22:07:47,612 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-08 22:07:47,612 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-08 22:07:47,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][405], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 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)), 115#L54true, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0), 207#L59-14true]) [2025-03-08 22:07:47,630 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2025-03-08 22:07:47,630 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-08 22:07:47,630 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-08 22:07:47,633 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-08 22:07:47,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][405], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 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)), 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 207#L59-14true]) [2025-03-08 22:07:47,634 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2025-03-08 22:07:47,634 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2025-03-08 22:07:47,634 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-08 22:07:47,634 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-08 22:07:47,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 218#L59-12true, Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 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, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-08 22:07:47,669 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2025-03-08 22:07:47,669 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-08 22:07:47,669 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-08 22:07:47,669 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2025-03-08 22:07:47,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1217] 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_thread3Thread1of1ForFork0_~i~2#1_39| 4) v_~C~0.offset_13) |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|)) |v_#race_39|) InVars {#race=|v_#race_40|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} OutVars{#race=|v_#race_39|, ~C~0.offset=v_~C~0.offset_13, thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_39|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_13} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 218#L59-12true, Black: 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, 430#L67-7true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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: 554#true, Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 115#L54true, 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, 556#(= |#race~B~0| 0), 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 507#(= |#race~N~0| 0), 282#L85-1true, 528#(= |#race~A~0| 0)]) [2025-03-08 22:07:47,669 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2025-03-08 22:07:47,669 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-08 22:07:47,669 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-08 22:07:47,669 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-08 22:07:47,898 INFO L124 PetriNetUnfolderBase]: 8434/64624 cut-off events. [2025-03-08 22:07:47,898 INFO L125 PetriNetUnfolderBase]: For 49205/54887 co-relation queries the response was YES. [2025-03-08 22:07:48,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109651 conditions, 64624 events. 8434/64624 cut-off events. For 49205/54887 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 930989 event pairs, 1041 based on Foata normal form. 501/61130 useless extension candidates. Maximal degree in co-relation 109598. Up to 4505 conditions per place. [2025-03-08 22:07:48,746 INFO L140 encePairwiseOnDemand]: 480/515 looper letters, 493 selfloop transitions, 44 changer transitions 0/939 dead transitions. [2025-03-08 22:07:48,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 939 transitions, 7205 flow [2025-03-08 22:07:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 22:07:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-08 22:07:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13770 transitions. [2025-03-08 22:07:48,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8355582524271845 [2025-03-08 22:07:48,758 INFO L175 Difference]: Start difference. First operand has 450 places, 576 transitions, 2541 flow. Second operand 32 states and 13770 transitions. [2025-03-08 22:07:48,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 939 transitions, 7205 flow [2025-03-08 22:07:49,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 939 transitions, 7169 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:49,013 INFO L231 Difference]: Finished difference. Result has 485 places, 593 transitions, 2700 flow [2025-03-08 22:07:49,014 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=32, PETRI_FLOW=2700, PETRI_PLACES=485, PETRI_TRANSITIONS=593} [2025-03-08 22:07:49,014 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, 30 predicate places. [2025-03-08 22:07:49,014 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 593 transitions, 2700 flow [2025-03-08 22:07:49,016 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-08 22:07:49,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:49,017 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-08 22:07:49,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:07:49,017 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-08 22:07:49,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash 438196735, now seen corresponding path program 2 times [2025-03-08 22:07:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612964073] [2025-03-08 22:07:49,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:07:49,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:49,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 252 statements into 2 equivalence classes. [2025-03-08 22:07:49,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 207 of 252 statements. [2025-03-08 22:07:49,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:07:49,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:50,075 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-08 22:07:50,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:50,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612964073] [2025-03-08 22:07:50,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612964073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:50,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:50,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-08 22:07:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394294115] [2025-03-08 22:07:50,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:50,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:07:50,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:50,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:07:50,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:07:53,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 515 [2025-03-08 22:07:53,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 593 transitions, 2700 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-08 22:07:53,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:53,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 515 [2025-03-08 22:07:53,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:55,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L59-21-->L59-19: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][294], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 50#L59-19true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 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)), 799#(and (= |thread3Thread1of1ForFork0_~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)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 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)), Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (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)) (= |thread1Thread1of1ForFork2_~i~0#1| 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) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 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)) (= |thread1Thread1of1ForFork2_~i~0#1| 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) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 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)), 115#L54true, 556#(= |#race~B~0| 0), 74#L67-23true, 282#L85-1true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-08 22:07:55,683 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2025-03-08 22:07:55,683 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-08 22:07:55,683 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2025-03-08 22:07:55,683 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-08 22:07:56,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1108] L59-21-->L59-19: Formula: (= |v_#race~B~0_3| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_3|} AuxVars[] AssignedVars[#race~B~0][294], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 645#(= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))), 50#L59-19true, Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 2)) |thread3Thread1of1ForFork0_#t~nondet12#1|) (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), 643#true, Black: 646#(and (= |thread3Thread1of1ForFork0_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset))) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork0_~i~2#1| 4) ~C~0.offset 1)) |thread3Thread1of1ForFork0_#t~nondet12#1|)), Black: 526#true, 603#true, Black: 723#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 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)), 799#(and (= |thread3Thread1of1ForFork0_~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)), Black: 721#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= |thread1Thread1of1ForFork2_~i~0#1| 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)), Black: 727#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (= (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)) (= |thread1Thread1of1ForFork2_~i~0#1| 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) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 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)) (= |thread1Thread1of1ForFork2_~i~0#1| 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) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 289#L87true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0)), Black: 605#(= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 543#(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) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 554#true, Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 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)), 556#(= |#race~B~0| 0), 74#L67-23true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2025-03-08 22:07:56,546 INFO L294 olderBase$Statistics]: this new event has 314 ancestors and is cut-off event [2025-03-08 22:07:56,546 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-08 22:07:56,546 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2025-03-08 22:07:56,546 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event