./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.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/chl-word-trans.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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:05:45,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:05:45,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:05:45,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:05:45,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:05:45,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:05:45,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:05:45,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:05:45,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:05:45,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:05:45,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:05:45,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:05:45,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:05:45,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:05:45,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:05:45,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:05:45,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:05:45,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:05:45,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:05:45,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:05:45,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:05:45,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:05:45,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:05:45,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:05:45,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:05:45,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:05:45,428 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-03-08 22:05:45,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:05:45,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:05:45,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:05:45,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:05:45,632 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:05:45,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-08 22:05:46,771 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345c58f72/8b0528bfa901465384d499202e679fee/FLAGef6255323 [2025-03-08 22:05:47,015 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:05:47,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-03-08 22:05:47,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345c58f72/8b0528bfa901465384d499202e679fee/FLAGef6255323 [2025-03-08 22:05:47,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345c58f72/8b0528bfa901465384d499202e679fee [2025-03-08 22:05:47,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:05:47,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:05:47,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:05:47,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:05:47,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:05:47,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6a6447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47, skipping insertion in model container [2025-03-08 22:05:47,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:05:47,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:05:47,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:05:47,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:05:47,312 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:05:47,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47 WrapperNode [2025-03-08 22:05:47,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:05:47,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:05:47,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:05:47,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:05:47,318 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:05:47" (1/1) ... [2025-03-08 22:05:47,329 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:05:47" (1/1) ... [2025-03-08 22:05:47,355 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 235 [2025-03-08 22:05:47,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:05:47,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:05:47,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:05:47,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:05:47,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:05:47,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:05:47,396 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:05:47,396 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:05:47,396 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (1/1) ... [2025-03-08 22:05:47,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:05:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:05:47,429 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:05:47,431 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:05:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:05:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:05:47,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:05:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:05:47,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:05:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:05:47,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:05:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:05:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:05:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:05:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:05:47,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:05:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:05:47,452 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:05:47,548 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:05:47,550 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:05:48,151 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:05:48,151 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:05:48,170 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:05:48,170 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:05:48,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:48 BoogieIcfgContainer [2025-03-08 22:05:48,170 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:05:48,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:05:48,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:05:48,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:05:48,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:05:47" (1/3) ... [2025-03-08 22:05:48,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f6c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:05:48, skipping insertion in model container [2025-03-08 22:05:48,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:47" (2/3) ... [2025-03-08 22:05:48,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f6c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:05:48, skipping insertion in model container [2025-03-08 22:05:48,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:48" (3/3) ... [2025-03-08 22:05:48,178 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-03-08 22:05:48,189 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:05:48,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 614 locations, 1 initial locations, 6 loop locations, and 75 error locations. [2025-03-08 22:05:48,191 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:05:48,328 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:05:48,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 623 places, 643 transitions, 1307 flow [2025-03-08 22:05:48,582 INFO L124 PetriNetUnfolderBase]: 30/640 cut-off events. [2025-03-08 22:05:48,584 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:05:48,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 640 events. 30/640 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1774 event pairs, 0 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 490. Up to 3 conditions per place. [2025-03-08 22:05:48,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 623 places, 643 transitions, 1307 flow [2025-03-08 22:05:48,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 601 places, 619 transitions, 1256 flow [2025-03-08 22:05:48,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:05:48,626 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;@5a8e3753, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:05:48,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2025-03-08 22:05:48,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:05:48,632 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-03-08 22:05:48,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:05:48,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:48,634 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] [2025-03-08 22:05:48,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:48,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1286438478, now seen corresponding path program 1 times [2025-03-08 22:05:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:48,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312104382] [2025-03-08 22:05:48,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:48,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:48,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:05:48,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:05:48,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:48,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:48,788 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:05:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312104382] [2025-03-08 22:05:48,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312104382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:48,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:48,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:48,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147031485] [2025-03-08 22:05:48,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:48,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:48,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:48,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:48,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:48,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-03-08 22:05:48,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 619 transitions, 1256 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:48,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:48,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-03-08 22:05:48,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:49,084 INFO L124 PetriNetUnfolderBase]: 51/1065 cut-off events. [2025-03-08 22:05:49,085 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-08 22:05:49,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 1065 events. 51/1065 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5333 event pairs, 12 based on Foata normal form. 27/895 useless extension candidates. Maximal degree in co-relation 832. Up to 38 conditions per place. [2025-03-08 22:05:49,102 INFO L140 encePairwiseOnDemand]: 631/643 looper letters, 13 selfloop transitions, 2 changer transitions 6/609 dead transitions. [2025-03-08 22:05:49,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 609 transitions, 1266 flow [2025-03-08 22:05:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-03-08 22:05:49,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-03-08 22:05:49,117 INFO L175 Difference]: Start difference. First operand has 601 places, 619 transitions, 1256 flow. Second operand 3 states and 1870 transitions. [2025-03-08 22:05:49,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 609 transitions, 1266 flow [2025-03-08 22:05:49,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:05:49,135 INFO L231 Difference]: Finished difference. Result has 596 places, 603 transitions, 1216 flow [2025-03-08 22:05:49,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1216, PETRI_PLACES=596, PETRI_TRANSITIONS=603} [2025-03-08 22:05:49,142 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -5 predicate places. [2025-03-08 22:05:49,142 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 603 transitions, 1216 flow [2025-03-08 22:05:49,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:49,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:49,144 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] [2025-03-08 22:05:49,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:05:49,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:49,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash 945220552, now seen corresponding path program 1 times [2025-03-08 22:05:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:49,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075320069] [2025-03-08 22:05:49,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:49,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 22:05:49,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 22:05:49,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:49,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:49,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:05:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075320069] [2025-03-08 22:05:49,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075320069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:49,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:49,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819304682] [2025-03-08 22:05:49,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:49,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:49,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:49,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:49,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-03-08 22:05:49,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 603 transitions, 1216 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:49,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:49,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-03-08 22:05:49,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:49,481 INFO L124 PetriNetUnfolderBase]: 79/1490 cut-off events. [2025-03-08 22:05:49,481 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:05:49,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1490 events. 79/1490 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9169 event pairs, 20 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 1522. Up to 50 conditions per place. [2025-03-08 22:05:49,511 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2025-03-08 22:05:49,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 602 transitions, 1244 flow [2025-03-08 22:05:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-03-08 22:05:49,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-03-08 22:05:49,515 INFO L175 Difference]: Start difference. First operand has 596 places, 603 transitions, 1216 flow. Second operand 3 states and 1861 transitions. [2025-03-08 22:05:49,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 602 transitions, 1244 flow [2025-03-08 22:05:49,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 602 transitions, 1240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:49,523 INFO L231 Difference]: Finished difference. Result has 589 places, 602 transitions, 1214 flow [2025-03-08 22:05:49,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1214, PETRI_PLACES=589, PETRI_TRANSITIONS=602} [2025-03-08 22:05:49,525 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -12 predicate places. [2025-03-08 22:05:49,525 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 602 transitions, 1214 flow [2025-03-08 22:05:49,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:49,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:49,526 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] [2025-03-08 22:05:49,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:05:49,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:49,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1743917730, now seen corresponding path program 1 times [2025-03-08 22:05:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:49,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830710536] [2025-03-08 22:05:49,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:49,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:05:49,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:05:49,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:49,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:49,583 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:05:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830710536] [2025-03-08 22:05:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830710536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:49,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:49,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:49,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280731173] [2025-03-08 22:05:49,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:49,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:49,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:49,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:49,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:49,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-03-08 22:05:49,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 602 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:49,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:49,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-03-08 22:05:49,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:49,859 INFO L124 PetriNetUnfolderBase]: 79/1477 cut-off events. [2025-03-08 22:05:49,860 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-03-08 22:05:49,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1477 events. 79/1477 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8443 event pairs, 20 based on Foata normal form. 0/1199 useless extension candidates. Maximal degree in co-relation 1493. Up to 50 conditions per place. [2025-03-08 22:05:49,876 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2025-03-08 22:05:49,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 601 transitions, 1242 flow [2025-03-08 22:05:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-03-08 22:05:49,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-03-08 22:05:49,881 INFO L175 Difference]: Start difference. First operand has 589 places, 602 transitions, 1214 flow. Second operand 3 states and 1861 transitions. [2025-03-08 22:05:49,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 601 transitions, 1242 flow [2025-03-08 22:05:49,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 601 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:49,887 INFO L231 Difference]: Finished difference. Result has 588 places, 601 transitions, 1212 flow [2025-03-08 22:05:49,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1212, PETRI_PLACES=588, PETRI_TRANSITIONS=601} [2025-03-08 22:05:49,889 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -13 predicate places. [2025-03-08 22:05:49,890 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 601 transitions, 1212 flow [2025-03-08 22:05:49,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:49,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:49,891 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] [2025-03-08 22:05:49,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:05:49,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:49,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1754749228, now seen corresponding path program 1 times [2025-03-08 22:05:49,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:49,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545095894] [2025-03-08 22:05:49,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:49,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:49,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 22:05:49,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 22:05:49,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:49,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:49,945 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:05:49,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:49,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545095894] [2025-03-08 22:05:49,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545095894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:49,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:49,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181139224] [2025-03-08 22:05:49,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:49,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:49,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:49,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:49,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-03-08 22:05:49,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 601 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 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:05:49,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:49,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-03-08 22:05:49,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,099 INFO L124 PetriNetUnfolderBase]: 51/1082 cut-off events. [2025-03-08 22:05:50,099 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-08 22:05:50,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 1082 events. 51/1082 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5480 event pairs, 12 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1081. Up to 39 conditions per place. [2025-03-08 22:05:50,116 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 14 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2025-03-08 22:05:50,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 600 transitions, 1242 flow [2025-03-08 22:05:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2025-03-08 22:05:50,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637117677553136 [2025-03-08 22:05:50,119 INFO L175 Difference]: Start difference. First operand has 588 places, 601 transitions, 1212 flow. Second operand 3 states and 1859 transitions. [2025-03-08 22:05:50,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 600 transitions, 1242 flow [2025-03-08 22:05:50,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 600 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:50,126 INFO L231 Difference]: Finished difference. Result has 587 places, 600 transitions, 1210 flow [2025-03-08 22:05:50,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=587, PETRI_TRANSITIONS=600} [2025-03-08 22:05:50,128 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -14 predicate places. [2025-03-08 22:05:50,128 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 600 transitions, 1210 flow [2025-03-08 22:05:50,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 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:05:50,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,130 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] [2025-03-08 22:05:50,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:05:50,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:50,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1627104303, now seen corresponding path program 1 times [2025-03-08 22:05:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772804554] [2025-03-08 22:05:50,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 22:05:50,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 22:05:50,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:50,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:50,189 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:05:50,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772804554] [2025-03-08 22:05:50,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772804554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:50,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636263663] [2025-03-08 22:05:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-03-08 22:05:50,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 600 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 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:05:50,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-03-08 22:05:50,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,452 INFO L124 PetriNetUnfolderBase]: 89/1777 cut-off events. [2025-03-08 22:05:50,452 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-03-08 22:05:50,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 1777 events. 89/1777 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11575 event pairs, 20 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1786. Up to 51 conditions per place. [2025-03-08 22:05:50,479 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 14 selfloop transitions, 2 changer transitions 0/599 dead transitions. [2025-03-08 22:05:50,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 599 transitions, 1240 flow [2025-03-08 22:05:50,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2025-03-08 22:05:50,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637117677553136 [2025-03-08 22:05:50,482 INFO L175 Difference]: Start difference. First operand has 587 places, 600 transitions, 1210 flow. Second operand 3 states and 1859 transitions. [2025-03-08 22:05:50,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 599 transitions, 1240 flow [2025-03-08 22:05:50,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 599 transitions, 1236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:50,491 INFO L231 Difference]: Finished difference. Result has 586 places, 599 transitions, 1208 flow [2025-03-08 22:05:50,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1208, PETRI_PLACES=586, PETRI_TRANSITIONS=599} [2025-03-08 22:05:50,492 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -15 predicate places. [2025-03-08 22:05:50,493 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 599 transitions, 1208 flow [2025-03-08 22:05:50,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 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:05:50,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,494 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] [2025-03-08 22:05:50,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:05:50,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:50,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1900324397, now seen corresponding path program 1 times [2025-03-08 22:05:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839742229] [2025-03-08 22:05:50,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:05:50,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:05:50,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:50,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:50,547 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:05:50,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839742229] [2025-03-08 22:05:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839742229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429735356] [2025-03-08 22:05:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-03-08 22:05:50,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 599 transitions, 1208 flow. Second operand has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 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:05:50,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-03-08 22:05:50,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,697 INFO L124 PetriNetUnfolderBase]: 49/858 cut-off events. [2025-03-08 22:05:50,697 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-03-08 22:05:50,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 858 events. 49/858 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3751 event pairs, 20 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 851. Up to 51 conditions per place. [2025-03-08 22:05:50,711 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 14 selfloop transitions, 2 changer transitions 0/598 dead transitions. [2025-03-08 22:05:50,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 598 transitions, 1238 flow [2025-03-08 22:05:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2025-03-08 22:05:50,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637117677553136 [2025-03-08 22:05:50,715 INFO L175 Difference]: Start difference. First operand has 586 places, 599 transitions, 1208 flow. Second operand 3 states and 1859 transitions. [2025-03-08 22:05:50,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 598 transitions, 1238 flow [2025-03-08 22:05:50,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 598 transitions, 1234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:50,722 INFO L231 Difference]: Finished difference. Result has 585 places, 598 transitions, 1206 flow [2025-03-08 22:05:50,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1206, PETRI_PLACES=585, PETRI_TRANSITIONS=598} [2025-03-08 22:05:50,725 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -16 predicate places. [2025-03-08 22:05:50,725 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 598 transitions, 1206 flow [2025-03-08 22:05:50,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 615.3333333333334) internal successors, (1846), 3 states have internal predecessors, (1846), 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:05:50,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:50,726 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] [2025-03-08 22:05:50,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:05:50,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:50,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:50,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1455813863, now seen corresponding path program 1 times [2025-03-08 22:05:50,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:50,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298426159] [2025-03-08 22:05:50,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:50,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:50,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 22:05:50,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 22:05:50,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:50,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:50,773 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:05:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298426159] [2025-03-08 22:05:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298426159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:50,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885915947] [2025-03-08 22:05:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:50,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:50,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:50,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:50,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 643 [2025-03-08 22:05:50,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 598 transitions, 1206 flow. Second operand has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 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:05:50,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:50,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 643 [2025-03-08 22:05:50,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,985 INFO L124 PetriNetUnfolderBase]: 93/1474 cut-off events. [2025-03-08 22:05:50,985 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2025-03-08 22:05:50,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 1474 events. 93/1474 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8991 event pairs, 32 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 1505. Up to 91 conditions per place. [2025-03-08 22:05:51,004 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 16 selfloop transitions, 1 changer transitions 0/593 dead transitions. [2025-03-08 22:05:51,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 593 transitions, 1230 flow [2025-03-08 22:05:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-03-08 22:05:51,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.960082944530845 [2025-03-08 22:05:51,008 INFO L175 Difference]: Start difference. First operand has 585 places, 598 transitions, 1206 flow. Second operand 3 states and 1852 transitions. [2025-03-08 22:05:51,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 593 transitions, 1230 flow [2025-03-08 22:05:51,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 593 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:51,015 INFO L231 Difference]: Finished difference. Result has 580 places, 593 transitions, 1194 flow [2025-03-08 22:05:51,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=580, PETRI_TRANSITIONS=593} [2025-03-08 22:05:51,016 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2025-03-08 22:05:51,017 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 593 transitions, 1194 flow [2025-03-08 22:05:51,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 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:05:51,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:51,019 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] [2025-03-08 22:05:51,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:05:51,019 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:51,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash 980813868, now seen corresponding path program 1 times [2025-03-08 22:05:51,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:51,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594760916] [2025-03-08 22:05:51,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:51,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 22:05:51,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 22:05:51,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:51,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:51,069 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:05:51,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:51,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594760916] [2025-03-08 22:05:51,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594760916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:51,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:51,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:51,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943718740] [2025-03-08 22:05:51,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:51,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:51,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:51,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:51,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-03-08 22:05:51,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 593 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:51,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:51,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-03-08 22:05:51,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:51,243 INFO L124 PetriNetUnfolderBase]: 51/1070 cut-off events. [2025-03-08 22:05:51,243 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-08 22:05:51,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 1070 events. 51/1070 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5106 event pairs, 12 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 1043. Up to 38 conditions per place. [2025-03-08 22:05:51,257 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2025-03-08 22:05:51,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 592 transitions, 1222 flow [2025-03-08 22:05:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-03-08 22:05:51,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-03-08 22:05:51,264 INFO L175 Difference]: Start difference. First operand has 580 places, 593 transitions, 1194 flow. Second operand 3 states and 1861 transitions. [2025-03-08 22:05:51,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 592 transitions, 1222 flow [2025-03-08 22:05:51,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 592 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:51,270 INFO L231 Difference]: Finished difference. Result has 580 places, 592 transitions, 1195 flow [2025-03-08 22:05:51,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1195, PETRI_PLACES=580, PETRI_TRANSITIONS=592} [2025-03-08 22:05:51,272 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2025-03-08 22:05:51,272 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 592 transitions, 1195 flow [2025-03-08 22:05:51,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:51,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:51,273 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] [2025-03-08 22:05:51,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:05:51,274 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:51,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash 6015076, now seen corresponding path program 1 times [2025-03-08 22:05:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740268773] [2025-03-08 22:05:51,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:51,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 22:05:51,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 22:05:51,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:51,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:51,749 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:05:51,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:51,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740268773] [2025-03-08 22:05:51,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740268773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:51,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:51,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:51,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987252223] [2025-03-08 22:05:51,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:51,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:51,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:51,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:51,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:52,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 643 [2025-03-08 22:05:52,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 592 transitions, 1195 flow. Second operand has 6 states, 6 states have (on average 537.5) internal successors, (3225), 6 states have internal predecessors, (3225), 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:05:52,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:52,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 643 [2025-03-08 22:05:52,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:57,839 INFO L124 PetriNetUnfolderBase]: 12846/49114 cut-off events. [2025-03-08 22:05:57,840 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2025-03-08 22:05:58,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66597 conditions, 49114 events. 12846/49114 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 645245 event pairs, 10080 based on Foata normal form. 0/40933 useless extension candidates. Maximal degree in co-relation 66521. Up to 17156 conditions per place. [2025-03-08 22:05:58,456 INFO L140 encePairwiseOnDemand]: 625/643 looper letters, 78 selfloop transitions, 15 changer transitions 0/589 dead transitions. [2025-03-08 22:05:58,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 589 transitions, 1375 flow [2025-03-08 22:05:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:58,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3312 transitions. [2025-03-08 22:05:58,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8584758942457231 [2025-03-08 22:05:58,461 INFO L175 Difference]: Start difference. First operand has 580 places, 592 transitions, 1195 flow. Second operand 6 states and 3312 transitions. [2025-03-08 22:05:58,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 589 transitions, 1375 flow [2025-03-08 22:05:58,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 589 transitions, 1371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:58,472 INFO L231 Difference]: Finished difference. Result has 580 places, 589 transitions, 1215 flow [2025-03-08 22:05:58,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1215, PETRI_PLACES=580, PETRI_TRANSITIONS=589} [2025-03-08 22:05:58,474 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2025-03-08 22:05:58,474 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 589 transitions, 1215 flow [2025-03-08 22:05:58,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 537.5) internal successors, (3225), 6 states have internal predecessors, (3225), 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:05:58,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:58,480 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] [2025-03-08 22:05:58,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:05:58,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:58,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2068764731, now seen corresponding path program 1 times [2025-03-08 22:05:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:58,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999380041] [2025-03-08 22:05:58,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:58,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:58,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:05:58,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:05:58,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:58,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:58,561 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:05:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999380041] [2025-03-08 22:05:58,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999380041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:58,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:58,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412369053] [2025-03-08 22:05:58,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:58,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:58,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:58,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:58,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:58,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 643 [2025-03-08 22:05:58,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 589 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 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:05:58,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:58,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 643 [2025-03-08 22:05:58,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:59,034 INFO L124 PetriNetUnfolderBase]: 184/2390 cut-off events. [2025-03-08 22:05:59,035 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2025-03-08 22:05:59,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 2390 events. 184/2390 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18731 event pairs, 64 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 2557. Up to 164 conditions per place. [2025-03-08 22:05:59,065 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 16 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2025-03-08 22:05:59,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 584 transitions, 1239 flow [2025-03-08 22:05:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-03-08 22:05:59,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.960082944530845 [2025-03-08 22:05:59,068 INFO L175 Difference]: Start difference. First operand has 580 places, 589 transitions, 1215 flow. Second operand 3 states and 1852 transitions. [2025-03-08 22:05:59,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 584 transitions, 1239 flow [2025-03-08 22:05:59,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 584 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:59,074 INFO L231 Difference]: Finished difference. Result has 572 places, 584 transitions, 1177 flow [2025-03-08 22:05:59,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1177, PETRI_PLACES=572, PETRI_TRANSITIONS=584} [2025-03-08 22:05:59,076 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2025-03-08 22:05:59,076 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 584 transitions, 1177 flow [2025-03-08 22:05:59,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 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:05:59,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:59,077 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] [2025-03-08 22:05:59,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:05:59,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:59,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash -416426763, now seen corresponding path program 1 times [2025-03-08 22:05:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:59,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480150205] [2025-03-08 22:05:59,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:59,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 22:05:59,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 22:05:59,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:59,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:59,118 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:05:59,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:59,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480150205] [2025-03-08 22:05:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480150205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:59,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:59,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736156327] [2025-03-08 22:05:59,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:59,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:59,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:59,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:59,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:59,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-03-08 22:05:59,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 584 transitions, 1177 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:59,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:59,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-03-08 22:05:59,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:59,300 INFO L124 PetriNetUnfolderBase]: 89/1741 cut-off events. [2025-03-08 22:05:59,301 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-08 22:05:59,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 1741 events. 89/1741 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 10025 event pairs, 20 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1733. Up to 50 conditions per place. [2025-03-08 22:05:59,323 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2025-03-08 22:05:59,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 583 transitions, 1205 flow [2025-03-08 22:05:59,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-03-08 22:05:59,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-03-08 22:05:59,326 INFO L175 Difference]: Start difference. First operand has 572 places, 584 transitions, 1177 flow. Second operand 3 states and 1861 transitions. [2025-03-08 22:05:59,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 583 transitions, 1205 flow [2025-03-08 22:05:59,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 583 transitions, 1204 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:59,332 INFO L231 Difference]: Finished difference. Result has 572 places, 583 transitions, 1178 flow [2025-03-08 22:05:59,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1174, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1178, PETRI_PLACES=572, PETRI_TRANSITIONS=583} [2025-03-08 22:05:59,333 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2025-03-08 22:05:59,333 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 583 transitions, 1178 flow [2025-03-08 22:05:59,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:59,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:59,334 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:05:59,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:05:59,335 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:59,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1129298010, now seen corresponding path program 1 times [2025-03-08 22:05:59,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:59,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334342294] [2025-03-08 22:05:59,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:59,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:59,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 22:05:59,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 22:05:59,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:59,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:59,381 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:05:59,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:59,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334342294] [2025-03-08 22:05:59,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334342294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:59,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:59,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:59,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448297640] [2025-03-08 22:05:59,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:59,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:59,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:59,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:59,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:59,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 643 [2025-03-08 22:05:59,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 583 transitions, 1178 flow. Second operand has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 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:05:59,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:59,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 643 [2025-03-08 22:05:59,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:59,690 INFO L124 PetriNetUnfolderBase]: 167/1866 cut-off events. [2025-03-08 22:05:59,690 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2025-03-08 22:05:59,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 1866 events. 167/1866 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12349 event pairs, 64 based on Foata normal form. 0/1580 useless extension candidates. Maximal degree in co-relation 1973. Up to 169 conditions per place. [2025-03-08 22:05:59,720 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 16 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2025-03-08 22:05:59,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 578 transitions, 1202 flow [2025-03-08 22:05:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-03-08 22:05:59,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.960082944530845 [2025-03-08 22:05:59,724 INFO L175 Difference]: Start difference. First operand has 572 places, 583 transitions, 1178 flow. Second operand 3 states and 1852 transitions. [2025-03-08 22:05:59,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 578 transitions, 1202 flow [2025-03-08 22:05:59,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 578 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:59,731 INFO L231 Difference]: Finished difference. Result has 567 places, 578 transitions, 1166 flow [2025-03-08 22:05:59,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=567, PETRI_TRANSITIONS=578} [2025-03-08 22:05:59,732 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2025-03-08 22:05:59,733 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 578 transitions, 1166 flow [2025-03-08 22:05:59,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 611.0) internal successors, (1833), 3 states have internal predecessors, (1833), 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:05:59,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:59,734 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] [2025-03-08 22:05:59,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:05:59,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:59,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:59,735 INFO L85 PathProgramCache]: Analyzing trace with hash 789927415, now seen corresponding path program 1 times [2025-03-08 22:05:59,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:59,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711433249] [2025-03-08 22:05:59,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:59,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:59,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 22:05:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 22:05:59,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:59,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:59,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711433249] [2025-03-08 22:05:59,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711433249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:59,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:59,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846549874] [2025-03-08 22:05:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:59,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:59,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:59,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:59,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-03-08 22:05:59,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 578 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:59,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:59,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-03-08 22:05:59,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:59,944 INFO L124 PetriNetUnfolderBase]: 49/829 cut-off events. [2025-03-08 22:05:59,945 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-03-08 22:05:59,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891 conditions, 829 events. 49/829 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3166 event pairs, 20 based on Foata normal form. 0/718 useless extension candidates. Maximal degree in co-relation 814. Up to 50 conditions per place. [2025-03-08 22:05:59,958 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2025-03-08 22:05:59,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 577 transitions, 1194 flow [2025-03-08 22:05:59,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-03-08 22:05:59,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-03-08 22:05:59,962 INFO L175 Difference]: Start difference. First operand has 567 places, 578 transitions, 1166 flow. Second operand 3 states and 1861 transitions. [2025-03-08 22:05:59,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 577 transitions, 1194 flow [2025-03-08 22:05:59,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 577 transitions, 1193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:59,969 INFO L231 Difference]: Finished difference. Result has 567 places, 577 transitions, 1167 flow [2025-03-08 22:05:59,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1167, PETRI_PLACES=567, PETRI_TRANSITIONS=577} [2025-03-08 22:05:59,971 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2025-03-08 22:05:59,971 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 577 transitions, 1167 flow [2025-03-08 22:05:59,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 616.3333333333334) internal successors, (1849), 3 states have internal predecessors, (1849), 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:05:59,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:59,973 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] [2025-03-08 22:05:59,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:05:59,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:05:59,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:59,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2115546490, now seen corresponding path program 1 times [2025-03-08 22:05:59,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:59,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871089010] [2025-03-08 22:05:59,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:59,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 22:05:59,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 22:05:59,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:59,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:00,036 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:06:00,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:00,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871089010] [2025-03-08 22:06:00,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871089010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:00,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:00,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957623763] [2025-03-08 22:06:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:00,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:00,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:00,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:00,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:00,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-03-08 22:06:00,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 577 transitions, 1167 flow. Second operand has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 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:06:00,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:00,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-03-08 22:06:00,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:00,299 INFO L124 PetriNetUnfolderBase]: 96/1554 cut-off events. [2025-03-08 22:06:00,299 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 22:06:00,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 1554 events. 96/1554 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9922 event pairs, 26 based on Foata normal form. 0/1320 useless extension candidates. Maximal degree in co-relation 1575. Up to 75 conditions per place. [2025-03-08 22:06:00,328 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 17 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2025-03-08 22:06:00,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 577 transitions, 1207 flow [2025-03-08 22:06:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2025-03-08 22:06:00,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652669777086573 [2025-03-08 22:06:00,331 INFO L175 Difference]: Start difference. First operand has 567 places, 577 transitions, 1167 flow. Second operand 3 states and 1862 transitions. [2025-03-08 22:06:00,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 577 transitions, 1207 flow [2025-03-08 22:06:00,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 577 transitions, 1203 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:00,343 INFO L231 Difference]: Finished difference. Result has 564 places, 575 transitions, 1169 flow [2025-03-08 22:06:00,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1169, PETRI_PLACES=564, PETRI_TRANSITIONS=575} [2025-03-08 22:06:00,345 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2025-03-08 22:06:00,345 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 575 transitions, 1169 flow [2025-03-08 22:06:00,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 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:06:00,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:00,346 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] [2025-03-08 22:06:00,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:06:00,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:00,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1520605593, now seen corresponding path program 1 times [2025-03-08 22:06:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136811770] [2025-03-08 22:06:00,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:00,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 22:06:00,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 22:06:00,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:00,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:00,403 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:06:00,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:00,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136811770] [2025-03-08 22:06:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136811770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:00,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909314358] [2025-03-08 22:06:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:00,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:00,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:00,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:00,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:00,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-03-08 22:06:00,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 575 transitions, 1169 flow. Second operand has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 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:06:00,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:00,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-03-08 22:06:00,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:00,749 INFO L124 PetriNetUnfolderBase]: 165/2322 cut-off events. [2025-03-08 22:06:00,749 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:06:00,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 2322 events. 165/2322 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 18244 event pairs, 50 based on Foata normal form. 0/1971 useless extension candidates. Maximal degree in co-relation 2420. Up to 123 conditions per place. [2025-03-08 22:06:00,781 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 17 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-03-08 22:06:00,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 575 transitions, 1209 flow [2025-03-08 22:06:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2025-03-08 22:06:00,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652669777086573 [2025-03-08 22:06:00,785 INFO L175 Difference]: Start difference. First operand has 564 places, 575 transitions, 1169 flow. Second operand 3 states and 1862 transitions. [2025-03-08 22:06:00,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 575 transitions, 1209 flow [2025-03-08 22:06:00,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 575 transitions, 1209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:00,794 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1175 flow [2025-03-08 22:06:00,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=563, PETRI_TRANSITIONS=573} [2025-03-08 22:06:00,795 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2025-03-08 22:06:00,795 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1175 flow [2025-03-08 22:06:00,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 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:06:00,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:00,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:00,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:06:00,796 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:00,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash -539882312, now seen corresponding path program 1 times [2025-03-08 22:06:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:00,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742496893] [2025-03-08 22:06:00,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:00,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 22:06:00,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 22:06:00,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:00,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:00,860 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:06:00,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742496893] [2025-03-08 22:06:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742496893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:00,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748373013] [2025-03-08 22:06:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:00,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:00,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:00,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:00,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-03-08 22:06:00,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 573 transitions, 1175 flow. Second operand has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 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:06:00,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:00,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-03-08 22:06:00,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:01,364 INFO L124 PetriNetUnfolderBase]: 251/3259 cut-off events. [2025-03-08 22:06:01,364 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2025-03-08 22:06:01,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3496 conditions, 3259 events. 251/3259 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 28570 event pairs, 52 based on Foata normal form. 1/2777 useless extension candidates. Maximal degree in co-relation 3418. Up to 202 conditions per place. [2025-03-08 22:06:01,407 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 17 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2025-03-08 22:06:01,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 573 transitions, 1215 flow [2025-03-08 22:06:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2025-03-08 22:06:01,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652669777086573 [2025-03-08 22:06:01,411 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1175 flow. Second operand 3 states and 1862 transitions. [2025-03-08 22:06:01,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 573 transitions, 1215 flow [2025-03-08 22:06:01,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 573 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:01,419 INFO L231 Difference]: Finished difference. Result has 562 places, 571 transitions, 1181 flow [2025-03-08 22:06:01,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=562, PETRI_TRANSITIONS=571} [2025-03-08 22:06:01,420 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2025-03-08 22:06:01,420 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 571 transitions, 1181 flow [2025-03-08 22:06:01,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 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:06:01,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:01,421 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:06:01,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:06:01,421 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:01,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:01,422 INFO L85 PathProgramCache]: Analyzing trace with hash 914156827, now seen corresponding path program 1 times [2025-03-08 22:06:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:01,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017244281] [2025-03-08 22:06:01,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:01,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:01,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 22:06:01,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 22:06:01,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:01,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:01,476 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:06:01,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017244281] [2025-03-08 22:06:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017244281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:01,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:01,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503008584] [2025-03-08 22:06:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:01,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:01,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:01,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:01,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 571 transitions, 1181 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 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:06:01,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:01,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:01,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:01,797 INFO L124 PetriNetUnfolderBase]: 109/2049 cut-off events. [2025-03-08 22:06:01,797 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-03-08 22:06:01,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 2049 events. 109/2049 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13374 event pairs, 8 based on Foata normal form. 1/1763 useless extension candidates. Maximal degree in co-relation 2081. Up to 33 conditions per place. [2025-03-08 22:06:01,824 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2025-03-08 22:06:01,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 572 transitions, 1215 flow [2025-03-08 22:06:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-03-08 22:06:01,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-03-08 22:06:01,827 INFO L175 Difference]: Start difference. First operand has 562 places, 571 transitions, 1181 flow. Second operand 3 states and 1870 transitions. [2025-03-08 22:06:01,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 572 transitions, 1215 flow [2025-03-08 22:06:01,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 572 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:01,834 INFO L231 Difference]: Finished difference. Result has 563 places, 570 transitions, 1183 flow [2025-03-08 22:06:01,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=563, PETRI_TRANSITIONS=570} [2025-03-08 22:06:01,834 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2025-03-08 22:06:01,834 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 570 transitions, 1183 flow [2025-03-08 22:06:01,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 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:06:01,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:01,836 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] [2025-03-08 22:06:01,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:06:01,836 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:01,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1663914528, now seen corresponding path program 1 times [2025-03-08 22:06:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766053789] [2025-03-08 22:06:01,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:01,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 22:06:01,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 22:06:01,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:01,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:01,896 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:06:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766053789] [2025-03-08 22:06:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766053789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:01,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:06:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939482407] [2025-03-08 22:06:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:01,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:01,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:01,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:01,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:01,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 570 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 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:06:01,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:01,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:01,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:02,061 INFO L124 PetriNetUnfolderBase]: 90/1581 cut-off events. [2025-03-08 22:06:02,061 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-08 22:06:02,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1697 conditions, 1581 events. 90/1581 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10262 event pairs, 12 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 1664. Up to 40 conditions per place. [2025-03-08 22:06:02,081 INFO L140 encePairwiseOnDemand]: 639/643 looper letters, 14 selfloop transitions, 3 changer transitions 0/573 dead transitions. [2025-03-08 22:06:02,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1225 flow [2025-03-08 22:06:02,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-03-08 22:06:02,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-03-08 22:06:02,083 INFO L175 Difference]: Start difference. First operand has 563 places, 570 transitions, 1183 flow. Second operand 3 states and 1872 transitions. [2025-03-08 22:06:02,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1225 flow [2025-03-08 22:06:02,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1221 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:02,089 INFO L231 Difference]: Finished difference. Result has 565 places, 571 transitions, 1197 flow [2025-03-08 22:06:02,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=565, PETRI_TRANSITIONS=571} [2025-03-08 22:06:02,089 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2025-03-08 22:06:02,089 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 571 transitions, 1197 flow [2025-03-08 22:06:02,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 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:06:02,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:02,090 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] [2025-03-08 22:06:02,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:06:02,090 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:02,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:02,091 INFO L85 PathProgramCache]: Analyzing trace with hash 147078821, now seen corresponding path program 1 times [2025-03-08 22:06:02,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:02,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615821957] [2025-03-08 22:06:02,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:02,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:02,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 22:06:02,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 22:06:02,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:02,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:02,129 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:06:02,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615821957] [2025-03-08 22:06:02,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615821957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:02,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:02,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:02,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843967468] [2025-03-08 22:06:02,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:02,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:02,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:02,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:02,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:02,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-03-08 22:06:02,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 571 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 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:06:02,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:02,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-03-08 22:06:02,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:02,461 INFO L124 PetriNetUnfolderBase]: 198/2668 cut-off events. [2025-03-08 22:06:02,461 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2025-03-08 22:06:02,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 2668 events. 198/2668 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20071 event pairs, 24 based on Foata normal form. 0/2311 useless extension candidates. Maximal degree in co-relation 2866. Up to 176 conditions per place. [2025-03-08 22:06:02,501 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 20 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2025-03-08 22:06:02,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 574 transitions, 1252 flow [2025-03-08 22:06:02,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2025-03-08 22:06:02,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966822187662001 [2025-03-08 22:06:02,504 INFO L175 Difference]: Start difference. First operand has 565 places, 571 transitions, 1197 flow. Second operand 3 states and 1865 transitions. [2025-03-08 22:06:02,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 574 transitions, 1252 flow [2025-03-08 22:06:02,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 574 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:02,510 INFO L231 Difference]: Finished difference. Result has 562 places, 569 transitions, 1197 flow [2025-03-08 22:06:02,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=562, PETRI_TRANSITIONS=569} [2025-03-08 22:06:02,510 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2025-03-08 22:06:02,511 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 569 transitions, 1197 flow [2025-03-08 22:06:02,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.3333333333334) internal successors, (1843), 3 states have internal predecessors, (1843), 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:06:02,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:02,511 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:06:02,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:06:02,511 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:02,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:02,512 INFO L85 PathProgramCache]: Analyzing trace with hash -694494757, now seen corresponding path program 1 times [2025-03-08 22:06:02,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:02,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055618678] [2025-03-08 22:06:02,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:02,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:02,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 22:06:02,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 22:06:02,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:02,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:02,548 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:06:02,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:02,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055618678] [2025-03-08 22:06:02,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055618678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:02,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:02,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909658073] [2025-03-08 22:06:02,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:02,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:02,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:02,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:02,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:02,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:02,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 569 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 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:06:02,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:02,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:02,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:02,887 INFO L124 PetriNetUnfolderBase]: 184/2913 cut-off events. [2025-03-08 22:06:02,887 INFO L125 PetriNetUnfolderBase]: For 18/69 co-relation queries the response was YES. [2025-03-08 22:06:02,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 2913 events. 184/2913 cut-off events. For 18/69 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 22162 event pairs, 16 based on Foata normal form. 2/2533 useless extension candidates. Maximal degree in co-relation 3056. Up to 80 conditions per place. [2025-03-08 22:06:02,931 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-03-08 22:06:02,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 570 transitions, 1231 flow [2025-03-08 22:06:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-03-08 22:06:02,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-03-08 22:06:02,934 INFO L175 Difference]: Start difference. First operand has 562 places, 569 transitions, 1197 flow. Second operand 3 states and 1870 transitions. [2025-03-08 22:06:02,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 570 transitions, 1231 flow [2025-03-08 22:06:02,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 570 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:02,939 INFO L231 Difference]: Finished difference. Result has 563 places, 568 transitions, 1199 flow [2025-03-08 22:06:02,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=563, PETRI_TRANSITIONS=568} [2025-03-08 22:06:02,940 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2025-03-08 22:06:02,940 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 568 transitions, 1199 flow [2025-03-08 22:06:02,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 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:06:02,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:02,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:02,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:06:02,941 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:02,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash 7494033, now seen corresponding path program 1 times [2025-03-08 22:06:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:02,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748702388] [2025-03-08 22:06:02,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:02,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 22:06:02,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 22:06:02,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:02,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:03,011 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:06:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748702388] [2025-03-08 22:06:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748702388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:03,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:03,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:06:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396510704] [2025-03-08 22:06:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:03,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:03,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:03,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:03,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:03,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:03,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 568 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 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:06:03,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:03,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:03,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:03,281 INFO L124 PetriNetUnfolderBase]: 154/2283 cut-off events. [2025-03-08 22:06:03,282 INFO L125 PetriNetUnfolderBase]: For 21/54 co-relation queries the response was YES. [2025-03-08 22:06:03,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 2283 events. 154/2283 cut-off events. For 21/54 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17159 event pairs, 24 based on Foata normal form. 0/1979 useless extension candidates. Maximal degree in co-relation 2441. Up to 78 conditions per place. [2025-03-08 22:06:03,325 INFO L140 encePairwiseOnDemand]: 639/643 looper letters, 14 selfloop transitions, 3 changer transitions 0/571 dead transitions. [2025-03-08 22:06:03,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 571 transitions, 1241 flow [2025-03-08 22:06:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-03-08 22:06:03,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-03-08 22:06:03,328 INFO L175 Difference]: Start difference. First operand has 563 places, 568 transitions, 1199 flow. Second operand 3 states and 1872 transitions. [2025-03-08 22:06:03,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 571 transitions, 1241 flow [2025-03-08 22:06:03,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 571 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:03,334 INFO L231 Difference]: Finished difference. Result has 565 places, 569 transitions, 1213 flow [2025-03-08 22:06:03,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=565, PETRI_TRANSITIONS=569} [2025-03-08 22:06:03,335 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2025-03-08 22:06:03,335 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 569 transitions, 1213 flow [2025-03-08 22:06:03,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 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:06:03,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:03,336 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] [2025-03-08 22:06:03,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:06:03,336 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:03,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:03,337 INFO L85 PathProgramCache]: Analyzing trace with hash -431289747, now seen corresponding path program 1 times [2025-03-08 22:06:03,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:03,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053372828] [2025-03-08 22:06:03,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:03,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 22:06:03,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 22:06:03,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:03,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:03,376 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:06:03,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053372828] [2025-03-08 22:06:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053372828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:03,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:03,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:03,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886031615] [2025-03-08 22:06:03,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:03,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:03,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:03,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:03,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:03,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 569 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 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:06:03,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:03,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:03,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:03,731 INFO L124 PetriNetUnfolderBase]: 162/2662 cut-off events. [2025-03-08 22:06:03,731 INFO L125 PetriNetUnfolderBase]: For 18/24 co-relation queries the response was YES. [2025-03-08 22:06:03,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2914 conditions, 2662 events. 162/2662 cut-off events. For 18/24 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19715 event pairs, 10 based on Foata normal form. 0/2328 useless extension candidates. Maximal degree in co-relation 2832. Up to 57 conditions per place. [2025-03-08 22:06:03,769 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-03-08 22:06:03,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 570 transitions, 1247 flow [2025-03-08 22:06:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-03-08 22:06:03,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-03-08 22:06:03,772 INFO L175 Difference]: Start difference. First operand has 565 places, 569 transitions, 1213 flow. Second operand 3 states and 1870 transitions. [2025-03-08 22:06:03,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 570 transitions, 1247 flow [2025-03-08 22:06:03,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 570 transitions, 1241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:03,779 INFO L231 Difference]: Finished difference. Result has 564 places, 568 transitions, 1209 flow [2025-03-08 22:06:03,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1209, PETRI_PLACES=564, PETRI_TRANSITIONS=568} [2025-03-08 22:06:03,779 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2025-03-08 22:06:03,779 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 568 transitions, 1209 flow [2025-03-08 22:06:03,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 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:06:03,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:03,780 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] [2025-03-08 22:06:03,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:06:03,780 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:03,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1523769253, now seen corresponding path program 1 times [2025-03-08 22:06:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:03,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144375493] [2025-03-08 22:06:03,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:03,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 22:06:03,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 22:06:03,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:03,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:03,831 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:06:03,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:03,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144375493] [2025-03-08 22:06:03,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144375493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:03,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:03,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:03,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377555601] [2025-03-08 22:06:03,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:03,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:03,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:03,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:03,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-03-08 22:06:03,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 568 transitions, 1209 flow. Second operand has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 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:06:03,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:03,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-03-08 22:06:03,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:04,411 INFO L124 PetriNetUnfolderBase]: 248/3369 cut-off events. [2025-03-08 22:06:04,412 INFO L125 PetriNetUnfolderBase]: For 15/29 co-relation queries the response was YES. [2025-03-08 22:06:04,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 3369 events. 248/3369 cut-off events. For 15/29 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 26558 event pairs, 32 based on Foata normal form. 1/2956 useless extension candidates. Maximal degree in co-relation 3722. Up to 175 conditions per place. [2025-03-08 22:06:04,472 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 20 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2025-03-08 22:06:04,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 571 transitions, 1264 flow [2025-03-08 22:06:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2025-03-08 22:06:04,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966822187662001 [2025-03-08 22:06:04,475 INFO L175 Difference]: Start difference. First operand has 564 places, 568 transitions, 1209 flow. Second operand 3 states and 1865 transitions. [2025-03-08 22:06:04,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 571 transitions, 1264 flow [2025-03-08 22:06:04,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 571 transitions, 1260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:04,482 INFO L231 Difference]: Finished difference. Result has 561 places, 566 transitions, 1211 flow [2025-03-08 22:06:04,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=561, PETRI_TRANSITIONS=566} [2025-03-08 22:06:04,483 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -40 predicate places. [2025-03-08 22:06:04,483 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 566 transitions, 1211 flow [2025-03-08 22:06:04,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 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:06:04,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:04,484 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] [2025-03-08 22:06:04,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:06:04,484 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:04,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:04,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1095101675, now seen corresponding path program 1 times [2025-03-08 22:06:04,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:04,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252116033] [2025-03-08 22:06:04,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:04,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 22:06:04,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 22:06:04,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:04,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:04,687 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:06:04,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:04,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252116033] [2025-03-08 22:06:04,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252116033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:04,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:04,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:06:04,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408055469] [2025-03-08 22:06:04,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:04,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:06:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:04,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:06:04,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:06:05,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-03-08 22:06:05,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 566 transitions, 1211 flow. Second operand has 8 states, 8 states have (on average 590.125) internal successors, (4721), 8 states have internal predecessors, (4721), 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:06:05,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:05,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-03-08 22:06:05,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:05,947 INFO L124 PetriNetUnfolderBase]: 311/4433 cut-off events. [2025-03-08 22:06:05,948 INFO L125 PetriNetUnfolderBase]: For 14/41 co-relation queries the response was YES. [2025-03-08 22:06:05,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 4433 events. 311/4433 cut-off events. For 14/41 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39969 event pairs, 52 based on Foata normal form. 7/3926 useless extension candidates. Maximal degree in co-relation 5048. Up to 214 conditions per place. [2025-03-08 22:06:06,009 INFO L140 encePairwiseOnDemand]: 628/643 looper letters, 70 selfloop transitions, 16 changer transitions 0/605 dead transitions. [2025-03-08 22:06:06,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 605 transitions, 1477 flow [2025-03-08 22:06:06,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:06:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:06:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6532 transitions. [2025-03-08 22:06:06,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235119468400962 [2025-03-08 22:06:06,016 INFO L175 Difference]: Start difference. First operand has 561 places, 566 transitions, 1211 flow. Second operand 11 states and 6532 transitions. [2025-03-08 22:06:06,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 605 transitions, 1477 flow [2025-03-08 22:06:06,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 605 transitions, 1477 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:06,022 INFO L231 Difference]: Finished difference. Result has 576 places, 575 transitions, 1295 flow [2025-03-08 22:06:06,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1295, PETRI_PLACES=576, PETRI_TRANSITIONS=575} [2025-03-08 22:06:06,023 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2025-03-08 22:06:06,023 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 575 transitions, 1295 flow [2025-03-08 22:06:06,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.125) internal successors, (4721), 8 states have internal predecessors, (4721), 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:06:06,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:06,024 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:06:06,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:06:06,024 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:06,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:06,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2135672182, now seen corresponding path program 1 times [2025-03-08 22:06:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:06,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117097941] [2025-03-08 22:06:06,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:06,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:06,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 22:06:06,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 22:06:06,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:06,062 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:06:06,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:06,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117097941] [2025-03-08 22:06:06,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117097941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:06,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:06,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364676052] [2025-03-08 22:06:06,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:06,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:06,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:06,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:06,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:06,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:06,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 575 transitions, 1295 flow. Second operand has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 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:06:06,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:06,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:06,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:06,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1629] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][495], [Black: 703#true, Black: 672#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 2#L127-16true, 658#(= |#race~n2~0| 0), Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 688#true, 674#(= |#race~count2~0| 0), 670#(= |#race~count1~0| 0), 732#true, 705#(= |#race~get2~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 707#true, Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 668#true]) [2025-03-08 22:06:06,455 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2025-03-08 22:06:06,455 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2025-03-08 22:06:06,455 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2025-03-08 22:06:06,455 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2025-03-08 22:06:06,464 INFO L124 PetriNetUnfolderBase]: 261/3042 cut-off events. [2025-03-08 22:06:06,465 INFO L125 PetriNetUnfolderBase]: For 84/129 co-relation queries the response was YES. [2025-03-08 22:06:06,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 3042 events. 261/3042 cut-off events. For 84/129 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24637 event pairs, 47 based on Foata normal form. 0/2672 useless extension candidates. Maximal degree in co-relation 3512. Up to 211 conditions per place. [2025-03-08 22:06:06,523 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2025-03-08 22:06:06,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 576 transitions, 1329 flow [2025-03-08 22:06:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-03-08 22:06:06,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-03-08 22:06:06,525 INFO L175 Difference]: Start difference. First operand has 576 places, 575 transitions, 1295 flow. Second operand 3 states and 1870 transitions. [2025-03-08 22:06:06,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 576 transitions, 1329 flow [2025-03-08 22:06:06,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 576 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:06,532 INFO L231 Difference]: Finished difference. Result has 576 places, 574 transitions, 1293 flow [2025-03-08 22:06:06,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1293, PETRI_PLACES=576, PETRI_TRANSITIONS=574} [2025-03-08 22:06:06,533 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2025-03-08 22:06:06,533 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 574 transitions, 1293 flow [2025-03-08 22:06:06,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 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:06:06,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:06,534 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] [2025-03-08 22:06:06,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:06:06,534 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:06,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:06,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1873182110, now seen corresponding path program 1 times [2025-03-08 22:06:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:06,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517900258] [2025-03-08 22:06:06,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:06,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:06,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 22:06:06,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 22:06:06,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:06,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:06,567 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:06:06,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517900258] [2025-03-08 22:06:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517900258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113305739] [2025-03-08 22:06:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:06,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:06,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:06,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:06,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:06,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 574 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 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:06:06,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:06,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:06,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:07,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L90-20-->L90-19: Formula: (= |v_#race~get1~0_12| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_12|} AuxVars[] AssignedVars[#race~get1~0][460], [406#L77-2true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), 353#L122-1true, 735#true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 688#true, 674#(= |#race~count2~0| 0), 670#(= |#race~count1~0| 0), 732#true, 705#(= |#race~get2~0| 0), 590#L50-19true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 293#L90-19true]) [2025-03-08 22:06:07,259 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2025-03-08 22:06:07,259 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-03-08 22:06:07,259 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-03-08 22:06:07,259 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-03-08 22:06:07,360 INFO L124 PetriNetUnfolderBase]: 442/6407 cut-off events. [2025-03-08 22:06:07,360 INFO L125 PetriNetUnfolderBase]: For 57/115 co-relation queries the response was YES. [2025-03-08 22:06:07,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7203 conditions, 6407 events. 442/6407 cut-off events. For 57/115 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 62254 event pairs, 36 based on Foata normal form. 0/5628 useless extension candidates. Maximal degree in co-relation 7113. Up to 170 conditions per place. [2025-03-08 22:06:07,476 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-03-08 22:06:07,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 575 transitions, 1327 flow [2025-03-08 22:06:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-03-08 22:06:07,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-03-08 22:06:07,479 INFO L175 Difference]: Start difference. First operand has 576 places, 574 transitions, 1293 flow. Second operand 3 states and 1870 transitions. [2025-03-08 22:06:07,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 575 transitions, 1327 flow [2025-03-08 22:06:07,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 575 transitions, 1323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:07,487 INFO L231 Difference]: Finished difference. Result has 575 places, 573 transitions, 1291 flow [2025-03-08 22:06:07,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=575, PETRI_TRANSITIONS=573} [2025-03-08 22:06:07,487 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -26 predicate places. [2025-03-08 22:06:07,487 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 573 transitions, 1291 flow [2025-03-08 22:06:07,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 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:06:07,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:07,488 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] [2025-03-08 22:06:07,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:06:07,488 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash -480714677, now seen corresponding path program 1 times [2025-03-08 22:06:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:07,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323579531] [2025-03-08 22:06:07,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:07,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 22:06:07,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 22:06:07,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:07,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:07,634 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:06:07,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:07,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323579531] [2025-03-08 22:06:07,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323579531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:07,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:07,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:06:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758863548] [2025-03-08 22:06:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:07,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:06:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:07,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:06:07,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:06:08,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-03-08 22:06:08,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 573 transitions, 1291 flow. Second operand has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:06:08,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:08,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-03-08 22:06:08,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:09,295 INFO L124 PetriNetUnfolderBase]: 701/8589 cut-off events. [2025-03-08 22:06:09,295 INFO L125 PetriNetUnfolderBase]: For 148/265 co-relation queries the response was YES. [2025-03-08 22:06:09,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10140 conditions, 8589 events. 701/8589 cut-off events. For 148/265 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 94501 event pairs, 150 based on Foata normal form. 16/7588 useless extension candidates. Maximal degree in co-relation 10048. Up to 473 conditions per place. [2025-03-08 22:06:09,380 INFO L140 encePairwiseOnDemand]: 628/643 looper letters, 66 selfloop transitions, 16 changer transitions 0/603 dead transitions. [2025-03-08 22:06:09,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 603 transitions, 1531 flow [2025-03-08 22:06:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:06:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:06:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6523 transitions. [2025-03-08 22:06:09,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9222395023328149 [2025-03-08 22:06:09,387 INFO L175 Difference]: Start difference. First operand has 575 places, 573 transitions, 1291 flow. Second operand 11 states and 6523 transitions. [2025-03-08 22:06:09,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 603 transitions, 1531 flow [2025-03-08 22:06:09,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 603 transitions, 1527 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:09,394 INFO L231 Difference]: Finished difference. Result has 588 places, 582 transitions, 1371 flow [2025-03-08 22:06:09,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1371, PETRI_PLACES=588, PETRI_TRANSITIONS=582} [2025-03-08 22:06:09,394 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -13 predicate places. [2025-03-08 22:06:09,394 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 582 transitions, 1371 flow [2025-03-08 22:06:09,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:06:09,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:09,396 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] [2025-03-08 22:06:09,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:06:09,396 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:09,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash 397431629, now seen corresponding path program 1 times [2025-03-08 22:06:09,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:09,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133596071] [2025-03-08 22:06:09,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:09,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:09,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 22:06:09,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 22:06:09,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:09,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:09,432 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:06:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133596071] [2025-03-08 22:06:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133596071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:06:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225579932] [2025-03-08 22:06:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:09,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:09,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:09,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:09,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 582 transitions, 1371 flow. Second operand has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 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:06:09,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:09,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:09,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:10,358 INFO L124 PetriNetUnfolderBase]: 700/6568 cut-off events. [2025-03-08 22:06:10,358 INFO L125 PetriNetUnfolderBase]: For 363/434 co-relation queries the response was YES. [2025-03-08 22:06:10,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8213 conditions, 6568 events. 700/6568 cut-off events. For 363/434 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 67565 event pairs, 204 based on Foata normal form. 0/5722 useless extension candidates. Maximal degree in co-relation 8115. Up to 747 conditions per place. [2025-03-08 22:06:10,470 INFO L140 encePairwiseOnDemand]: 639/643 looper letters, 14 selfloop transitions, 3 changer transitions 0/585 dead transitions. [2025-03-08 22:06:10,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 585 transitions, 1413 flow [2025-03-08 22:06:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-03-08 22:06:10,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-03-08 22:06:10,472 INFO L175 Difference]: Start difference. First operand has 588 places, 582 transitions, 1371 flow. Second operand 3 states and 1872 transitions. [2025-03-08 22:06:10,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 585 transitions, 1413 flow [2025-03-08 22:06:10,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 585 transitions, 1409 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:10,483 INFO L231 Difference]: Finished difference. Result has 591 places, 583 transitions, 1385 flow [2025-03-08 22:06:10,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1385, PETRI_PLACES=591, PETRI_TRANSITIONS=583} [2025-03-08 22:06:10,483 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -10 predicate places. [2025-03-08 22:06:10,484 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 583 transitions, 1385 flow [2025-03-08 22:06:10,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.3333333333334) internal successors, (1861), 3 states have internal predecessors, (1861), 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:06:10,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:10,484 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] [2025-03-08 22:06:10,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:06:10,484 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:10,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1304459348, now seen corresponding path program 1 times [2025-03-08 22:06:10,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972519459] [2025-03-08 22:06:10,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:10,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 22:06:10,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 22:06:10,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:10,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:10,515 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:06:10,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:10,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972519459] [2025-03-08 22:06:10,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972519459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:10,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:10,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296945683] [2025-03-08 22:06:10,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:10,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:10,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:10,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:10,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:10,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:10,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 583 transitions, 1385 flow. Second operand has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 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:06:10,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:10,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:10,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:11,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1629] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][475], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 2#L127-16true, 658#(= |#race~n2~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 768#true, Black: 668#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 763#true, Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 743#(<= ~n2~0 0), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:11,255 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-03-08 22:06:11,255 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2025-03-08 22:06:11,255 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-08 22:06:11,255 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-08 22:06:11,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1629] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][475], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 2#L127-16true, 658#(= |#race~n2~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 668#true, 768#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 763#true, 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:11,263 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is not cut-off event [2025-03-08 22:06:11,263 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2025-03-08 22:06:11,263 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2025-03-08 22:06:11,263 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is not cut-off event [2025-03-08 22:06:11,274 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1629] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][475], [Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 2#L127-16true, 658#(= |#race~n2~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 668#true, 768#true, Black: 672#true, Black: 676#true, 664#(= |#race~n3~0| 0), 763#true, 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:11,274 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2025-03-08 22:06:11,274 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-08 22:06:11,274 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-03-08 22:06:11,274 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-03-08 22:06:11,274 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-08 22:06:11,278 INFO L124 PetriNetUnfolderBase]: 493/5346 cut-off events. [2025-03-08 22:06:11,278 INFO L125 PetriNetUnfolderBase]: For 288/357 co-relation queries the response was YES. [2025-03-08 22:06:11,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6870 conditions, 5346 events. 493/5346 cut-off events. For 288/357 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 51512 event pairs, 86 based on Foata normal form. 2/4834 useless extension candidates. Maximal degree in co-relation 6772. Up to 416 conditions per place. [2025-03-08 22:06:11,368 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/584 dead transitions. [2025-03-08 22:06:11,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 584 transitions, 1419 flow [2025-03-08 22:06:11,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-03-08 22:06:11,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-03-08 22:06:11,370 INFO L175 Difference]: Start difference. First operand has 591 places, 583 transitions, 1385 flow. Second operand 3 states and 1870 transitions. [2025-03-08 22:06:11,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 584 transitions, 1419 flow [2025-03-08 22:06:11,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 584 transitions, 1413 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:11,379 INFO L231 Difference]: Finished difference. Result has 590 places, 582 transitions, 1381 flow [2025-03-08 22:06:11,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1381, PETRI_PLACES=590, PETRI_TRANSITIONS=582} [2025-03-08 22:06:11,380 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -11 predicate places. [2025-03-08 22:06:11,380 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 582 transitions, 1381 flow [2025-03-08 22:06:11,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 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:06:11,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:11,381 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] [2025-03-08 22:06:11,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:06:11,381 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:11,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash -931251002, now seen corresponding path program 1 times [2025-03-08 22:06:11,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:11,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89411813] [2025-03-08 22:06:11,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:11,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:11,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 22:06:11,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 22:06:11,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:11,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:11,568 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:06:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89411813] [2025-03-08 22:06:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89411813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:11,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:11,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:06:11,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442123] [2025-03-08 22:06:11,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:11,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:06:11,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:11,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:06:11,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:06:11,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-03-08 22:06:11,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 582 transitions, 1381 flow. Second operand has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 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:06:11,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:11,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-03-08 22:06:11,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:12,767 INFO L124 PetriNetUnfolderBase]: 603/5602 cut-off events. [2025-03-08 22:06:12,768 INFO L125 PetriNetUnfolderBase]: For 380/477 co-relation queries the response was YES. [2025-03-08 22:06:12,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7573 conditions, 5602 events. 603/5602 cut-off events. For 380/477 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 52466 event pairs, 179 based on Foata normal form. 17/5035 useless extension candidates. Maximal degree in co-relation 7473. Up to 678 conditions per place. [2025-03-08 22:06:12,837 INFO L140 encePairwiseOnDemand]: 626/643 looper letters, 79 selfloop transitions, 19 changer transitions 0/623 dead transitions. [2025-03-08 22:06:12,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 623 transitions, 1707 flow [2025-03-08 22:06:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:06:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 22:06:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7121 transitions. [2025-03-08 22:06:12,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228875064800415 [2025-03-08 22:06:12,840 INFO L175 Difference]: Start difference. First operand has 590 places, 582 transitions, 1381 flow. Second operand 12 states and 7121 transitions. [2025-03-08 22:06:12,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 623 transitions, 1707 flow [2025-03-08 22:06:12,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 623 transitions, 1703 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:12,849 INFO L231 Difference]: Finished difference. Result has 603 places, 587 transitions, 1457 flow [2025-03-08 22:06:12,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1457, PETRI_PLACES=603, PETRI_TRANSITIONS=587} [2025-03-08 22:06:12,850 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 2 predicate places. [2025-03-08 22:06:12,850 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 587 transitions, 1457 flow [2025-03-08 22:06:12,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 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:06:12,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:12,850 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] [2025-03-08 22:06:12,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:06:12,851 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:12,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:12,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1341716510, now seen corresponding path program 1 times [2025-03-08 22:06:12,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:12,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506115339] [2025-03-08 22:06:12,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:12,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:12,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-08 22:06:12,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-08 22:06:12,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:12,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:06:12,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:12,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506115339] [2025-03-08 22:06:12,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506115339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:12,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:12,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:06:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42161455] [2025-03-08 22:06:12,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:12,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:06:12,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:12,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:06:12,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:06:13,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-03-08 22:06:13,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 587 transitions, 1457 flow. Second operand has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:06:13,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:13,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-03-08 22:06:13,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:14,278 INFO L124 PetriNetUnfolderBase]: 416/5737 cut-off events. [2025-03-08 22:06:14,278 INFO L125 PetriNetUnfolderBase]: For 305/328 co-relation queries the response was YES. [2025-03-08 22:06:14,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7646 conditions, 5737 events. 416/5737 cut-off events. For 305/328 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 53603 event pairs, 52 based on Foata normal form. 2/5278 useless extension candidates. Maximal degree in co-relation 7539. Up to 215 conditions per place. [2025-03-08 22:06:14,366 INFO L140 encePairwiseOnDemand]: 626/643 looper letters, 71 selfloop transitions, 24 changer transitions 0/621 dead transitions. [2025-03-08 22:06:14,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 621 transitions, 1763 flow [2025-03-08 22:06:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 22:06:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-08 22:06:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7114 transitions. [2025-03-08 22:06:14,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219803006739243 [2025-03-08 22:06:14,369 INFO L175 Difference]: Start difference. First operand has 603 places, 587 transitions, 1457 flow. Second operand 12 states and 7114 transitions. [2025-03-08 22:06:14,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 621 transitions, 1763 flow [2025-03-08 22:06:14,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 621 transitions, 1746 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:06:14,380 INFO L231 Difference]: Finished difference. Result has 612 places, 596 transitions, 1573 flow [2025-03-08 22:06:14,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1573, PETRI_PLACES=612, PETRI_TRANSITIONS=596} [2025-03-08 22:06:14,381 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 11 predicate places. [2025-03-08 22:06:14,381 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 596 transitions, 1573 flow [2025-03-08 22:06:14,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:06:14,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:14,382 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] [2025-03-08 22:06:14,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:06:14,382 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:14,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1040408273, now seen corresponding path program 1 times [2025-03-08 22:06:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:14,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738223006] [2025-03-08 22:06:14,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:14,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 22:06:14,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 22:06:14,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:14,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:06:14,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:14,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738223006] [2025-03-08 22:06:14,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738223006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:14,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:14,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:06:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556730665] [2025-03-08 22:06:14,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:06:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:14,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:06:14,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:06:14,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-03-08 22:06:14,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 596 transitions, 1573 flow. Second operand has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 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:06:14,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:14,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-03-08 22:06:14,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:16,646 INFO L124 PetriNetUnfolderBase]: 940/11014 cut-off events. [2025-03-08 22:06:16,646 INFO L125 PetriNetUnfolderBase]: For 1008/1143 co-relation queries the response was YES. [2025-03-08 22:06:16,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15176 conditions, 11014 events. 940/11014 cut-off events. For 1008/1143 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 125514 event pairs, 192 based on Foata normal form. 4/10107 useless extension candidates. Maximal degree in co-relation 15061. Up to 594 conditions per place. [2025-03-08 22:06:16,757 INFO L140 encePairwiseOnDemand]: 627/643 looper letters, 69 selfloop transitions, 20 changer transitions 0/624 dead transitions. [2025-03-08 22:06:16,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 624 transitions, 1853 flow [2025-03-08 22:06:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:06:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:06:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2025-03-08 22:06:16,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212498232715962 [2025-03-08 22:06:16,760 INFO L175 Difference]: Start difference. First operand has 612 places, 596 transitions, 1573 flow. Second operand 11 states and 6516 transitions. [2025-03-08 22:06:16,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 624 transitions, 1853 flow [2025-03-08 22:06:16,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 624 transitions, 1836 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:06:16,774 INFO L231 Difference]: Finished difference. Result has 621 places, 609 transitions, 1694 flow [2025-03-08 22:06:16,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1694, PETRI_PLACES=621, PETRI_TRANSITIONS=609} [2025-03-08 22:06:16,775 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 20 predicate places. [2025-03-08 22:06:16,775 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 609 transitions, 1694 flow [2025-03-08 22:06:16,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 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:06:16,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:16,776 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] [2025-03-08 22:06:16,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:06:16,776 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:16,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:16,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2012015751, now seen corresponding path program 1 times [2025-03-08 22:06:16,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:16,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787980925] [2025-03-08 22:06:16,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:16,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 22:06:16,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 22:06:16,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:16,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:06:16,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:16,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787980925] [2025-03-08 22:06:16,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787980925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:16,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:16,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:06:16,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661867592] [2025-03-08 22:06:16,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:16,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:06:16,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:16,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:06:16,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:06:17,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-03-08 22:06:17,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 609 transitions, 1694 flow. Second operand has 8 states, 8 states have (on average 590.5) internal successors, (4724), 8 states have internal predecessors, (4724), 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:06:17,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:17,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-03-08 22:06:17,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:18,457 INFO L124 PetriNetUnfolderBase]: 761/7083 cut-off events. [2025-03-08 22:06:18,458 INFO L125 PetriNetUnfolderBase]: For 1363/1483 co-relation queries the response was YES. [2025-03-08 22:06:18,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10697 conditions, 7083 events. 761/7083 cut-off events. For 1363/1483 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 69479 event pairs, 234 based on Foata normal form. 19/6523 useless extension candidates. Maximal degree in co-relation 10573. Up to 915 conditions per place. [2025-03-08 22:06:18,582 INFO L140 encePairwiseOnDemand]: 627/643 looper letters, 70 selfloop transitions, 21 changer transitions 0/633 dead transitions. [2025-03-08 22:06:18,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 633 transitions, 1981 flow [2025-03-08 22:06:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:06:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:06:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2025-03-08 22:06:18,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212498232715962 [2025-03-08 22:06:18,585 INFO L175 Difference]: Start difference. First operand has 621 places, 609 transitions, 1694 flow. Second operand 11 states and 6516 transitions. [2025-03-08 22:06:18,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 633 transitions, 1981 flow [2025-03-08 22:06:18,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 633 transitions, 1977 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:18,600 INFO L231 Difference]: Finished difference. Result has 633 places, 618 transitions, 1823 flow [2025-03-08 22:06:18,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1690, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1823, PETRI_PLACES=633, PETRI_TRANSITIONS=618} [2025-03-08 22:06:18,601 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 32 predicate places. [2025-03-08 22:06:18,601 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 618 transitions, 1823 flow [2025-03-08 22:06:18,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.5) internal successors, (4724), 8 states have internal predecessors, (4724), 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:06:18,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:18,602 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] [2025-03-08 22:06:18,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:06:18,602 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:18,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1543106876, now seen corresponding path program 1 times [2025-03-08 22:06:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:18,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413028687] [2025-03-08 22:06:18,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:18,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 22:06:18,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 22:06:18,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:18,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:06:18,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:18,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413028687] [2025-03-08 22:06:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413028687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:18,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:18,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:18,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390443264] [2025-03-08 22:06:18,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:18,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:18,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:18,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:18,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:19,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-03-08 22:06:19,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 618 transitions, 1823 flow. Second operand has 6 states, 6 states have (on average 599.8333333333334) internal successors, (3599), 6 states have internal predecessors, (3599), 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:06:19,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:19,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-03-08 22:06:19,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:20,887 INFO L124 PetriNetUnfolderBase]: 682/9716 cut-off events. [2025-03-08 22:06:20,888 INFO L125 PetriNetUnfolderBase]: For 2266/2334 co-relation queries the response was YES. [2025-03-08 22:06:20,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14082 conditions, 9716 events. 682/9716 cut-off events. For 2266/2334 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 101657 event pairs, 45 based on Foata normal form. 10/9035 useless extension candidates. Maximal degree in co-relation 13954. Up to 286 conditions per place. [2025-03-08 22:06:21,026 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/625 dead transitions. [2025-03-08 22:06:21,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 625 transitions, 1945 flow [2025-03-08 22:06:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-03-08 22:06:21,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-03-08 22:06:21,028 INFO L175 Difference]: Start difference. First operand has 633 places, 618 transitions, 1823 flow. Second operand 6 states and 3626 transitions. [2025-03-08 22:06:21,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 625 transitions, 1945 flow [2025-03-08 22:06:21,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 625 transitions, 1924 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 22:06:21,051 INFO L231 Difference]: Finished difference. Result has 630 places, 617 transitions, 1821 flow [2025-03-08 22:06:21,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1798, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1821, PETRI_PLACES=630, PETRI_TRANSITIONS=617} [2025-03-08 22:06:21,051 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 29 predicate places. [2025-03-08 22:06:21,051 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 617 transitions, 1821 flow [2025-03-08 22:06:21,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 599.8333333333334) internal successors, (3599), 6 states have internal predecessors, (3599), 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:06:21,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:21,052 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] [2025-03-08 22:06:21,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:06:21,052 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:21,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2059404240, now seen corresponding path program 1 times [2025-03-08 22:06:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188156979] [2025-03-08 22:06:21,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:21,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 22:06:21,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 22:06:21,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:21,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:06:21,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:21,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188156979] [2025-03-08 22:06:21,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188156979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:21,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:21,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:21,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285984023] [2025-03-08 22:06:21,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:21,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:21,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:21,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:21,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:21,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-03-08 22:06:21,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 617 transitions, 1821 flow. Second operand has 6 states, 6 states have (on average 600.0) internal successors, (3600), 6 states have internal predecessors, (3600), 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:06:21,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:21,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-03-08 22:06:21,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:23,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L90-20-->L90-19: Formula: (= |v_#race~get1~0_12| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_12|} AuxVars[] AssignedVars[#race~get1~0][552], [658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 353#L122-1true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 874#true, Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), 122#L76true, Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 867#true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), 590#L50-19true, Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 293#L90-19true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:23,443 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-03-08 22:06:23,443 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-08 22:06:23,443 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-08 22:06:23,443 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-03-08 22:06:23,454 INFO L124 PetriNetUnfolderBase]: 734/10389 cut-off events. [2025-03-08 22:06:23,454 INFO L125 PetriNetUnfolderBase]: For 2603/2778 co-relation queries the response was YES. [2025-03-08 22:06:23,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15077 conditions, 10389 events. 734/10389 cut-off events. For 2603/2778 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 110130 event pairs, 70 based on Foata normal form. 11/9607 useless extension candidates. Maximal degree in co-relation 14949. Up to 376 conditions per place. [2025-03-08 22:06:23,546 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/624 dead transitions. [2025-03-08 22:06:23,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 624 transitions, 1943 flow [2025-03-08 22:06:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-03-08 22:06:23,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-03-08 22:06:23,548 INFO L175 Difference]: Start difference. First operand has 630 places, 617 transitions, 1821 flow. Second operand 6 states and 3626 transitions. [2025-03-08 22:06:23,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 624 transitions, 1943 flow [2025-03-08 22:06:23,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 624 transitions, 1930 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-08 22:06:23,571 INFO L231 Difference]: Finished difference. Result has 630 places, 616 transitions, 1827 flow [2025-03-08 22:06:23,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1804, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1827, PETRI_PLACES=630, PETRI_TRANSITIONS=616} [2025-03-08 22:06:23,572 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 29 predicate places. [2025-03-08 22:06:23,572 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 616 transitions, 1827 flow [2025-03-08 22:06:23,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.0) internal successors, (3600), 6 states have internal predecessors, (3600), 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:06:23,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:23,572 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] [2025-03-08 22:06:23,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:06:23,572 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:23,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash -892402991, now seen corresponding path program 1 times [2025-03-08 22:06:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980942137] [2025-03-08 22:06:23,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:23,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-08 22:06:23,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-08 22:06:23,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:23,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:06:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:23,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980942137] [2025-03-08 22:06:23,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980942137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:23,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:23,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:23,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771740906] [2025-03-08 22:06:23,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:23,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:23,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:23,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:23,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:23,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-03-08 22:06:23,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 616 transitions, 1827 flow. Second operand has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 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:06:23,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:23,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-03-08 22:06:23,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:25,092 INFO L124 PetriNetUnfolderBase]: 774/9776 cut-off events. [2025-03-08 22:06:25,092 INFO L125 PetriNetUnfolderBase]: For 1640/1665 co-relation queries the response was YES. [2025-03-08 22:06:25,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13544 conditions, 9776 events. 774/9776 cut-off events. For 1640/1665 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 96806 event pairs, 86 based on Foata normal form. 0/9037 useless extension candidates. Maximal degree in co-relation 13416. Up to 557 conditions per place. [2025-03-08 22:06:25,263 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 19 selfloop transitions, 2 changer transitions 0/618 dead transitions. [2025-03-08 22:06:25,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 618 transitions, 1877 flow [2025-03-08 22:06:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1864 transitions. [2025-03-08 22:06:25,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663037843442198 [2025-03-08 22:06:25,264 INFO L175 Difference]: Start difference. First operand has 630 places, 616 transitions, 1827 flow. Second operand 3 states and 1864 transitions. [2025-03-08 22:06:25,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 618 transitions, 1877 flow [2025-03-08 22:06:25,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 618 transitions, 1864 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-08 22:06:25,280 INFO L231 Difference]: Finished difference. Result has 625 places, 614 transitions, 1820 flow [2025-03-08 22:06:25,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1820, PETRI_PLACES=625, PETRI_TRANSITIONS=614} [2025-03-08 22:06:25,281 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 24 predicate places. [2025-03-08 22:06:25,281 INFO L471 AbstractCegarLoop]: Abstraction has has 625 places, 614 transitions, 1820 flow [2025-03-08 22:06:25,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.6666666666666) internal successors, (1844), 3 states have internal predecessors, (1844), 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:06:25,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:25,281 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] [2025-03-08 22:06:25,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:06:25,281 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:25,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:25,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1761953504, now seen corresponding path program 1 times [2025-03-08 22:06:25,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:25,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146983326] [2025-03-08 22:06:25,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:25,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:25,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-08 22:06:25,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-08 22:06:25,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:25,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:25,588 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:06:25,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:25,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146983326] [2025-03-08 22:06:25,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146983326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:25,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:25,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921513301] [2025-03-08 22:06:25,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:25,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:25,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:25,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:25,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:26,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-03-08 22:06:26,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 614 transitions, 1820 flow. Second operand has 6 states, 6 states have (on average 599.8333333333334) internal successors, (3599), 6 states have internal predecessors, (3599), 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:06:26,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:26,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-03-08 22:06:26,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:27,600 INFO L124 PetriNetUnfolderBase]: 747/10933 cut-off events. [2025-03-08 22:06:27,600 INFO L125 PetriNetUnfolderBase]: For 2479/2551 co-relation queries the response was YES. [2025-03-08 22:06:27,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15780 conditions, 10933 events. 747/10933 cut-off events. For 2479/2551 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 114621 event pairs, 52 based on Foata normal form. 10/10261 useless extension candidates. Maximal degree in co-relation 15651. Up to 314 conditions per place. [2025-03-08 22:06:27,776 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/620 dead transitions. [2025-03-08 22:06:27,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 620 transitions, 1936 flow [2025-03-08 22:06:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-03-08 22:06:27,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-03-08 22:06:27,778 INFO L175 Difference]: Start difference. First operand has 625 places, 614 transitions, 1820 flow. Second operand 6 states and 3626 transitions. [2025-03-08 22:06:27,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 620 transitions, 1936 flow [2025-03-08 22:06:27,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 620 transitions, 1936 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:27,802 INFO L231 Difference]: Finished difference. Result has 628 places, 612 transitions, 1828 flow [2025-03-08 22:06:27,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1828, PETRI_PLACES=628, PETRI_TRANSITIONS=612} [2025-03-08 22:06:27,803 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 27 predicate places. [2025-03-08 22:06:27,803 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 612 transitions, 1828 flow [2025-03-08 22:06:27,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 599.8333333333334) internal successors, (3599), 6 states have internal predecessors, (3599), 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:06:27,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:27,804 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] [2025-03-08 22:06:27,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:06:27,804 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:27,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1785724892, now seen corresponding path program 1 times [2025-03-08 22:06:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:27,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333245930] [2025-03-08 22:06:27,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:27,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:27,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-08 22:06:27,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-08 22:06:27,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:27,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:06:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333245930] [2025-03-08 22:06:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333245930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312771469] [2025-03-08 22:06:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:28,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:28,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:28,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-03-08 22:06:28,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 612 transitions, 1828 flow. Second operand has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:06:28,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:28,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-03-08 22:06:28,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:29,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1630] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][589], [658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), 244#L90-16true, Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 893#(= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 885#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 256#L125true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:29,768 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-03-08 22:06:29,768 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-08 22:06:29,768 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-08 22:06:29,768 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2025-03-08 22:06:29,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1630] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][593], [658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 885#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 264#L90-15true, 256#L125true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 894#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:29,771 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-03-08 22:06:29,771 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-08 22:06:29,771 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-08 22:06:29,771 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-03-08 22:06:29,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1630] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][598], [658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 31#L90-14true, 885#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), 895#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 256#L125true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:29,773 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-03-08 22:06:29,773 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-08 22:06:29,773 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2025-03-08 22:06:29,774 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-08 22:06:29,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1630] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][601], [658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 885#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 883#(= |#race~get3~0| 0), 113#L90-12true, Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 256#L125true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:29,776 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2025-03-08 22:06:29,776 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-03-08 22:06:29,776 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-03-08 22:06:29,776 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2025-03-08 22:06:29,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1630] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][601], [658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 885#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 50#L90-13true, Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 256#L125true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:29,778 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2025-03-08 22:06:29,778 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-08 22:06:29,778 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-08 22:06:29,778 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2025-03-08 22:06:29,796 INFO L124 PetriNetUnfolderBase]: 711/7183 cut-off events. [2025-03-08 22:06:29,796 INFO L125 PetriNetUnfolderBase]: For 2331/2555 co-relation queries the response was YES. [2025-03-08 22:06:29,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11101 conditions, 7183 events. 711/7183 cut-off events. For 2331/2555 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 70077 event pairs, 97 based on Foata normal form. 33/6784 useless extension candidates. Maximal degree in co-relation 10971. Up to 461 conditions per place. [2025-03-08 22:06:29,872 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/619 dead transitions. [2025-03-08 22:06:29,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 619 transitions, 1950 flow [2025-03-08 22:06:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-03-08 22:06:29,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-03-08 22:06:29,875 INFO L175 Difference]: Start difference. First operand has 628 places, 612 transitions, 1828 flow. Second operand 6 states and 3626 transitions. [2025-03-08 22:06:29,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 619 transitions, 1950 flow [2025-03-08 22:06:29,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 619 transitions, 1938 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:06:29,890 INFO L231 Difference]: Finished difference. Result has 627 places, 611 transitions, 1835 flow [2025-03-08 22:06:29,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1835, PETRI_PLACES=627, PETRI_TRANSITIONS=611} [2025-03-08 22:06:29,891 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 26 predicate places. [2025-03-08 22:06:29,891 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 611 transitions, 1835 flow [2025-03-08 22:06:29,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:06:29,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:29,892 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] [2025-03-08 22:06:29,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 22:06:29,892 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:29,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash 308609076, now seen corresponding path program 1 times [2025-03-08 22:06:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:29,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443352308] [2025-03-08 22:06:29,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:29,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:29,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-08 22:06:29,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-08 22:06:29,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:29,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:30,197 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:06:30,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:30,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443352308] [2025-03-08 22:06:30,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443352308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:30,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:30,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:30,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378747897] [2025-03-08 22:06:30,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:30,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:30,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:30,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:30,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:30,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-03-08 22:06:30,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 611 transitions, 1835 flow. Second operand has 6 states, 6 states have (on average 600.0) internal successors, (3600), 6 states have internal predecessors, (3600), 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:06:30,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:30,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-03-08 22:06:30,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:32,269 INFO L124 PetriNetUnfolderBase]: 778/10893 cut-off events. [2025-03-08 22:06:32,269 INFO L125 PetriNetUnfolderBase]: For 2961/3141 co-relation queries the response was YES. [2025-03-08 22:06:32,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16450 conditions, 10893 events. 778/10893 cut-off events. For 2961/3141 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 116916 event pairs, 76 based on Foata normal form. 15/10289 useless extension candidates. Maximal degree in co-relation 16319. Up to 419 conditions per place. [2025-03-08 22:06:32,498 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/617 dead transitions. [2025-03-08 22:06:32,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 617 transitions, 1951 flow [2025-03-08 22:06:32,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-03-08 22:06:32,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-03-08 22:06:32,500 INFO L175 Difference]: Start difference. First operand has 627 places, 611 transitions, 1835 flow. Second operand 6 states and 3626 transitions. [2025-03-08 22:06:32,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 617 transitions, 1951 flow [2025-03-08 22:06:32,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 617 transitions, 1938 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-08 22:06:32,532 INFO L231 Difference]: Finished difference. Result has 626 places, 609 transitions, 1830 flow [2025-03-08 22:06:32,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1830, PETRI_PLACES=626, PETRI_TRANSITIONS=609} [2025-03-08 22:06:32,533 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 25 predicate places. [2025-03-08 22:06:32,533 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 609 transitions, 1830 flow [2025-03-08 22:06:32,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.0) internal successors, (3600), 6 states have internal predecessors, (3600), 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:06:32,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:32,534 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] [2025-03-08 22:06:32,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 22:06:32,534 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:32,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash 169648501, now seen corresponding path program 1 times [2025-03-08 22:06:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:32,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612969379] [2025-03-08 22:06:32,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:32,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:32,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-08 22:06:32,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-08 22:06:32,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:32,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:32,573 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:06:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612969379] [2025-03-08 22:06:32,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612969379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:32,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:32,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191259332] [2025-03-08 22:06:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:32,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:32,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:32,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:32,587 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 643 [2025-03-08 22:06:32,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 609 transitions, 1830 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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:06:32,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:32,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 643 [2025-03-08 22:06:32,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:34,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1629] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][431], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, 904#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 898#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 2#L127-16true, Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:34,103 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-03-08 22:06:34,103 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-03-08 22:06:34,103 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-03-08 22:06:34,103 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-03-08 22:06:34,124 INFO L124 PetriNetUnfolderBase]: 683/10524 cut-off events. [2025-03-08 22:06:34,125 INFO L125 PetriNetUnfolderBase]: For 2284/2319 co-relation queries the response was YES. [2025-03-08 22:06:34,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15194 conditions, 10524 events. 683/10524 cut-off events. For 2284/2319 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 108608 event pairs, 51 based on Foata normal form. 0/9956 useless extension candidates. Maximal degree in co-relation 15064. Up to 320 conditions per place. [2025-03-08 22:06:34,295 INFO L140 encePairwiseOnDemand]: 641/643 looper letters, 10 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2025-03-08 22:06:34,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 608 transitions, 1850 flow [2025-03-08 22:06:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-03-08 22:06:34,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-03-08 22:06:34,296 INFO L175 Difference]: Start difference. First operand has 626 places, 609 transitions, 1830 flow. Second operand 3 states and 1872 transitions. [2025-03-08 22:06:34,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 608 transitions, 1850 flow [2025-03-08 22:06:34,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 608 transitions, 1838 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:06:34,320 INFO L231 Difference]: Finished difference. Result has 622 places, 608 transitions, 1818 flow [2025-03-08 22:06:34,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1818, PETRI_PLACES=622, PETRI_TRANSITIONS=608} [2025-03-08 22:06:34,321 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 21 predicate places. [2025-03-08 22:06:34,321 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 608 transitions, 1818 flow [2025-03-08 22:06:34,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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:06:34,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:34,321 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:06:34,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 22:06:34,321 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:34,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:34,322 INFO L85 PathProgramCache]: Analyzing trace with hash 785660096, now seen corresponding path program 1 times [2025-03-08 22:06:34,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:34,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648216819] [2025-03-08 22:06:34,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:34,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:34,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-08 22:06:34,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-08 22:06:34,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:34,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:06:34,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:34,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648216819] [2025-03-08 22:06:34,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648216819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:34,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:34,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:06:34,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518372428] [2025-03-08 22:06:34,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:34,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:06:34,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:34,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:06:34,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:06:34,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-03-08 22:06:34,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 608 transitions, 1818 flow. Second operand has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:06:34,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:34,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-03-08 22:06:34,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:36,182 INFO L124 PetriNetUnfolderBase]: 636/6942 cut-off events. [2025-03-08 22:06:36,182 INFO L125 PetriNetUnfolderBase]: For 2396/2596 co-relation queries the response was YES. [2025-03-08 22:06:36,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 6942 events. 636/6942 cut-off events. For 2396/2596 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 66717 event pairs, 97 based on Foata normal form. 41/6642 useless extension candidates. Maximal degree in co-relation 10603. Up to 467 conditions per place. [2025-03-08 22:06:36,247 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/614 dead transitions. [2025-03-08 22:06:36,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 614 transitions, 1934 flow [2025-03-08 22:06:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:06:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:06:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-03-08 22:06:36,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-03-08 22:06:36,249 INFO L175 Difference]: Start difference. First operand has 622 places, 608 transitions, 1818 flow. Second operand 6 states and 3626 transitions. [2025-03-08 22:06:36,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 614 transitions, 1934 flow [2025-03-08 22:06:36,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 614 transitions, 1933 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:36,263 INFO L231 Difference]: Finished difference. Result has 624 places, 606 transitions, 1825 flow [2025-03-08 22:06:36,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1825, PETRI_PLACES=624, PETRI_TRANSITIONS=606} [2025-03-08 22:06:36,264 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 23 predicate places. [2025-03-08 22:06:36,264 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 606 transitions, 1825 flow [2025-03-08 22:06:36,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:06:36,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:36,265 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, 1, 1] [2025-03-08 22:06:36,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 22:06:36,265 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:36,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash -889651652, now seen corresponding path program 1 times [2025-03-08 22:06:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255107431] [2025-03-08 22:06:36,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:36,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-08 22:06:36,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-08 22:06:36,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:36,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:36,298 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:06:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255107431] [2025-03-08 22:06:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255107431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378405012] [2025-03-08 22:06:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:36,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:36,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:36,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:36,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:36,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 643 [2025-03-08 22:06:36,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 606 transitions, 1825 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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:06:36,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:36,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 643 [2025-03-08 22:06:36,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:37,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1629] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][431], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, 913#true, Black: 672#true, 795#true, Black: 676#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 907#true, 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 2#L127-16true, Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:37,962 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-03-08 22:06:37,962 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-03-08 22:06:37,962 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-03-08 22:06:37,962 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-03-08 22:06:37,974 INFO L124 PetriNetUnfolderBase]: 688/10505 cut-off events. [2025-03-08 22:06:37,975 INFO L125 PetriNetUnfolderBase]: For 2436/2506 co-relation queries the response was YES. [2025-03-08 22:06:38,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15478 conditions, 10505 events. 688/10505 cut-off events. For 2436/2506 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 110139 event pairs, 76 based on Foata normal form. 0/10006 useless extension candidates. Maximal degree in co-relation 15348. Up to 384 conditions per place. [2025-03-08 22:06:38,179 INFO L140 encePairwiseOnDemand]: 641/643 looper letters, 10 selfloop transitions, 1 changer transitions 0/605 dead transitions. [2025-03-08 22:06:38,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 605 transitions, 1845 flow [2025-03-08 22:06:38,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-03-08 22:06:38,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-03-08 22:06:38,181 INFO L175 Difference]: Start difference. First operand has 624 places, 606 transitions, 1825 flow. Second operand 3 states and 1872 transitions. [2025-03-08 22:06:38,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 605 transitions, 1845 flow [2025-03-08 22:06:38,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 605 transitions, 1833 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:06:38,211 INFO L231 Difference]: Finished difference. Result has 620 places, 605 transitions, 1813 flow [2025-03-08 22:06:38,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1813, PETRI_PLACES=620, PETRI_TRANSITIONS=605} [2025-03-08 22:06:38,211 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 19 predicate places. [2025-03-08 22:06:38,212 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 605 transitions, 1813 flow [2025-03-08 22:06:38,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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:06:38,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:38,212 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, 1, 1, 1, 1] [2025-03-08 22:06:38,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 22:06:38,212 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:38,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:38,213 INFO L85 PathProgramCache]: Analyzing trace with hash -883461164, now seen corresponding path program 1 times [2025-03-08 22:06:38,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:38,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752726701] [2025-03-08 22:06:38,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:38,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-08 22:06:38,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-08 22:06:38,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:38,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:38,256 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:06:38,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:38,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752726701] [2025-03-08 22:06:38,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752726701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:38,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:38,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:06:38,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795988653] [2025-03-08 22:06:38,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:38,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:06:38,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:38,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:06:38,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:06:38,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-03-08 22:06:38,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 605 transitions, 1813 flow. Second operand has 4 states, 4 states have (on average 616.75) internal successors, (2467), 4 states have internal predecessors, (2467), 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:06:38,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:38,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-03-08 22:06:38,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:39,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1629] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][431], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, 913#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 2#L127-16true, Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:39,063 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-03-08 22:06:39,063 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-03-08 22:06:39,063 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-03-08 22:06:39,063 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-03-08 22:06:39,066 INFO L124 PetriNetUnfolderBase]: 345/5842 cut-off events. [2025-03-08 22:06:39,066 INFO L125 PetriNetUnfolderBase]: For 1203/1238 co-relation queries the response was YES. [2025-03-08 22:06:39,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8429 conditions, 5842 events. 345/5842 cut-off events. For 1203/1238 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 51424 event pairs, 7 based on Foata normal form. 15/5609 useless extension candidates. Maximal degree in co-relation 8298. Up to 158 conditions per place. [2025-03-08 22:06:39,153 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 12 selfloop transitions, 0 changer transitions 2/606 dead transitions. [2025-03-08 22:06:39,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 606 transitions, 1843 flow [2025-03-08 22:06:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:06:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 22:06:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2471 transitions. [2025-03-08 22:06:39,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607309486780715 [2025-03-08 22:06:39,155 INFO L175 Difference]: Start difference. First operand has 620 places, 605 transitions, 1813 flow. Second operand 4 states and 2471 transitions. [2025-03-08 22:06:39,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 606 transitions, 1843 flow [2025-03-08 22:06:39,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 606 transitions, 1842 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:06:39,169 INFO L231 Difference]: Finished difference. Result has 624 places, 604 transitions, 1814 flow [2025-03-08 22:06:39,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1814, PETRI_PLACES=624, PETRI_TRANSITIONS=604} [2025-03-08 22:06:39,170 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 23 predicate places. [2025-03-08 22:06:39,170 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 604 transitions, 1814 flow [2025-03-08 22:06:39,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 616.75) internal successors, (2467), 4 states have internal predecessors, (2467), 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:06:39,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:39,171 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:39,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 22:06:39,171 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:39,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1171118257, now seen corresponding path program 1 times [2025-03-08 22:06:39,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:39,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456575820] [2025-03-08 22:06:39,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:39,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:39,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-08 22:06:39,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-08 22:06:39,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:39,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:39,205 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:06:39,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:39,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456575820] [2025-03-08 22:06:39,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456575820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:39,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:39,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:39,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125137172] [2025-03-08 22:06:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:39,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:39,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:39,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:39,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:39,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 643 [2025-03-08 22:06:39,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 604 transitions, 1814 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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:06:39,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:39,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 643 [2025-03-08 22:06:39,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:40,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1566] L97-2-->L97: Formula: (= |v_thread3Thread1of1ForFork2_#t~nondet26_3| |v_#race~res3~0_6|) InVars {thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][391], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), 214#L97true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 918#(not |ULTIMATE.start_main_#t~short52#1|), Black: 921#(and (not |ULTIMATE.start_main_#t~short53#1|) (not |ULTIMATE.start_main_#t~short52#1|)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 924#true, 916#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 256#L125true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:40,092 INFO L294 olderBase$Statistics]: this new event has 390 ancestors and is cut-off event [2025-03-08 22:06:40,092 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-08 22:06:40,092 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-08 22:06:40,092 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-08 22:06:40,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1629] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][431], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 918#(not |ULTIMATE.start_main_#t~short52#1|), Black: 921#(and (not |ULTIMATE.start_main_#t~short53#1|) (not |ULTIMATE.start_main_#t~short52#1|)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 2#L127-16true, Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:40,111 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-03-08 22:06:40,111 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-03-08 22:06:40,111 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is cut-off event [2025-03-08 22:06:40,111 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-03-08 22:06:40,112 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1629] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][431], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 918#(not |ULTIMATE.start_main_#t~short52#1|), Black: 921#(and (not |ULTIMATE.start_main_#t~short53#1|) (not |ULTIMATE.start_main_#t~short52#1|)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 2#L127-16true, Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:40,112 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-03-08 22:06:40,112 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-03-08 22:06:40,112 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-03-08 22:06:40,112 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-03-08 22:06:40,112 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-03-08 22:06:40,116 INFO L124 PetriNetUnfolderBase]: 464/6048 cut-off events. [2025-03-08 22:06:40,116 INFO L125 PetriNetUnfolderBase]: For 1278/1329 co-relation queries the response was YES. [2025-03-08 22:06:40,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8897 conditions, 6048 events. 464/6048 cut-off events. For 1278/1329 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 55914 event pairs, 98 based on Foata normal form. 15/5754 useless extension candidates. Maximal degree in co-relation 8854. Up to 389 conditions per place. [2025-03-08 22:06:40,222 INFO L140 encePairwiseOnDemand]: 641/643 looper letters, 8 selfloop transitions, 0 changer transitions 21/603 dead transitions. [2025-03-08 22:06:40,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 603 transitions, 1832 flow [2025-03-08 22:06:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2025-03-08 22:06:40,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9699326075686885 [2025-03-08 22:06:40,223 INFO L175 Difference]: Start difference. First operand has 624 places, 604 transitions, 1814 flow. Second operand 3 states and 1871 transitions. [2025-03-08 22:06:40,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 603 transitions, 1832 flow [2025-03-08 22:06:40,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 603 transitions, 1828 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:40,237 INFO L231 Difference]: Finished difference. Result has 621 places, 582 transitions, 1677 flow [2025-03-08 22:06:40,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=621, PETRI_TRANSITIONS=582} [2025-03-08 22:06:40,238 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 20 predicate places. [2025-03-08 22:06:40,238 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 582 transitions, 1677 flow [2025-03-08 22:06:40,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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:06:40,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:40,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:40,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 22:06:40,238 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:40,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 542561599, now seen corresponding path program 1 times [2025-03-08 22:06:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:40,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242862045] [2025-03-08 22:06:40,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:40,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 22:06:40,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 22:06:40,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:40,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:40,279 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:06:40,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242862045] [2025-03-08 22:06:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242862045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293130310] [2025-03-08 22:06:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:40,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:40,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:40,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:40,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 582 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 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:06:40,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:40,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:40,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:41,834 INFO L124 PetriNetUnfolderBase]: 625/9646 cut-off events. [2025-03-08 22:06:41,835 INFO L125 PetriNetUnfolderBase]: For 1707/1733 co-relation queries the response was YES. [2025-03-08 22:06:41,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13639 conditions, 9646 events. 625/9646 cut-off events. For 1707/1733 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 96707 event pairs, 53 based on Foata normal form. 0/9218 useless extension candidates. Maximal degree in co-relation 13597. Up to 279 conditions per place. [2025-03-08 22:06:42,007 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 11 selfloop transitions, 2 changer transitions 14/583 dead transitions. [2025-03-08 22:06:42,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 583 transitions, 1707 flow [2025-03-08 22:06:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2025-03-08 22:06:42,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683773976153447 [2025-03-08 22:06:42,009 INFO L175 Difference]: Start difference. First operand has 621 places, 582 transitions, 1677 flow. Second operand 3 states and 1868 transitions. [2025-03-08 22:06:42,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 583 transitions, 1707 flow [2025-03-08 22:06:42,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 583 transitions, 1693 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-08 22:06:42,031 INFO L231 Difference]: Finished difference. Result has 608 places, 567 transitions, 1561 flow [2025-03-08 22:06:42,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1561, PETRI_PLACES=608, PETRI_TRANSITIONS=567} [2025-03-08 22:06:42,032 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 7 predicate places. [2025-03-08 22:06:42,032 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 567 transitions, 1561 flow [2025-03-08 22:06:42,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 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:06:42,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:42,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:06:42,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 22:06:42,033 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:42,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:42,034 INFO L85 PathProgramCache]: Analyzing trace with hash 958161084, now seen corresponding path program 1 times [2025-03-08 22:06:42,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:42,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013912907] [2025-03-08 22:06:42,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:42,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-08 22:06:42,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-08 22:06:42,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:42,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:06:42,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:42,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013912907] [2025-03-08 22:06:42,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013912907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:42,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:42,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:42,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409953014] [2025-03-08 22:06:42,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:42,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:42,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:42,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:42,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:42,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 567 transitions, 1561 flow. Second operand has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 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:06:42,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:42,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:42,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:43,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L90-20-->L90-19: Formula: (= |v_#race~get1~0_12| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_12|} AuxVars[] AssignedVars[#race~get1~0][479], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 18#L77true, 658#(= |#race~n2~0| 0), 927#true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 930#true, 353#L122-1true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 590#L50-19true, Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 293#L90-19true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:43,228 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-03-08 22:06:43,228 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2025-03-08 22:06:43,228 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-03-08 22:06:43,228 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-03-08 22:06:43,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L50-13-->L50-11: Formula: (= |v_#race~get2~0_6| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_6|} AuxVars[] AssignedVars[#race~get2~0][466], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), 81#L70-19true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 927#true, Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 930#true, 353#L122-1true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 293#L90-19true, 401#L50-11true, Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:43,299 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-03-08 22:06:43,299 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-03-08 22:06:43,299 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-03-08 22:06:43,299 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-08 22:06:43,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1630] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][420], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 658#(= |#race~n2~0| 0), 927#true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 930#true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 256#L125true, Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|), 293#L90-19true]) [2025-03-08 22:06:43,314 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2025-03-08 22:06:43,314 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2025-03-08 22:06:43,314 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-03-08 22:06:43,314 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-03-08 22:06:43,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1453] L77-2-->L77: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_3|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_3|} AuxVars[] AssignedVars[#race~res2~0][348], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 18#L77true, 658#(= |#race~n2~0| 0), 927#true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), 646#(= |#race~n1~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 563#L124true, 883#(= |#race~get3~0| 0), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 832#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 838#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 824#(<= ~n3~0 0), Black: 825#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), 930#true, Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 863#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 850#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 849#(<= ~n3~0 0), Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 881#true, 705#(= |#race~get2~0| 0), 670#(= |#race~count1~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|), 293#L90-19true]) [2025-03-08 22:06:43,315 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2025-03-08 22:06:43,315 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-08 22:06:43,315 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-03-08 22:06:43,315 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-08 22:06:43,315 INFO L124 PetriNetUnfolderBase]: 536/7958 cut-off events. [2025-03-08 22:06:43,315 INFO L125 PetriNetUnfolderBase]: For 1220/1260 co-relation queries the response was YES. [2025-03-08 22:06:43,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11146 conditions, 7958 events. 536/7958 cut-off events. For 1220/1260 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 77219 event pairs, 63 based on Foata normal form. 1/7620 useless extension candidates. Maximal degree in co-relation 11103. Up to 233 conditions per place. [2025-03-08 22:06:43,450 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 11 selfloop transitions, 2 changer transitions 13/568 dead transitions. [2025-03-08 22:06:43,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 568 transitions, 1591 flow [2025-03-08 22:06:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2025-03-08 22:06:43,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683773976153447 [2025-03-08 22:06:43,451 INFO L175 Difference]: Start difference. First operand has 608 places, 567 transitions, 1561 flow. Second operand 3 states and 1868 transitions. [2025-03-08 22:06:43,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 568 transitions, 1591 flow [2025-03-08 22:06:43,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 568 transitions, 1539 flow, removed 16 selfloop flow, removed 13 redundant places. [2025-03-08 22:06:43,470 INFO L231 Difference]: Finished difference. Result has 589 places, 553 transitions, 1426 flow [2025-03-08 22:06:43,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1426, PETRI_PLACES=589, PETRI_TRANSITIONS=553} [2025-03-08 22:06:43,471 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -12 predicate places. [2025-03-08 22:06:43,471 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 553 transitions, 1426 flow [2025-03-08 22:06:43,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.6666666666666) internal successors, (1859), 3 states have internal predecessors, (1859), 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:06:43,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:43,472 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, 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:06:43,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 22:06:43,472 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2025-03-08 22:06:43,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1687737281, now seen corresponding path program 1 times [2025-03-08 22:06:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:43,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655701818] [2025-03-08 22:06:43,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:43,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 22:06:43,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 22:06:43,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:43,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:06:43,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655701818] [2025-03-08 22:06:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655701818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:43,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:43,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485138901] [2025-03-08 22:06:43,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:43,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:43,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:43,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:43,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:43,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-03-08 22:06:43,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 553 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 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:06:43,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:43,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-03-08 22:06:43,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:44,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L50-13-->L50-11: Formula: (= |v_#race~get2~0_6| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_6|} AuxVars[] AssignedVars[#race~get2~0][431], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 930#true, 81#L70-19true, 353#L122-1true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(<= ~n1~0 0), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 674#(= |#race~count2~0| 0), Black: 881#true, 933#true, 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 771#true, Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|), 401#L50-11true, 293#L90-19true, 883#(= |#race~get3~0| 0)]) [2025-03-08 22:06:44,065 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-03-08 22:06:44,065 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-08 22:06:44,065 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-03-08 22:06:44,065 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-03-08 22:06:44,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1566] L97-2-->L97: Formula: (= |v_thread3Thread1of1ForFork2_#t~nondet26_3| |v_#race~res3~0_6|) InVars {thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][393], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 930#true, 81#L70-19true, 214#L97true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(<= ~n1~0 0), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 668#true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, Black: 881#true, 933#true, 674#(= |#race~count2~0| 0), 670#(= |#race~count1~0| 0), 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 563#L124true, 883#(= |#race~get3~0| 0), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:44,083 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2025-03-08 22:06:44,083 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-03-08 22:06:44,083 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-08 22:06:44,083 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-08 22:06:44,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1566] L97-2-->L97: Formula: (= |v_thread3Thread1of1ForFork2_#t~nondet26_3| |v_#race~res3~0_6|) InVars {thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][393], [Black: 896#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 703#true, 678#(= |#race~count3~0| 0), 690#(= |#race~get1~0| 0), 658#(= |#race~n2~0| 0), Black: 830#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 930#true, 214#L97true, Black: 790#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(<= ~n1~0 0), Black: 777#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 668#true, 256#L125true, Black: 672#true, 795#true, Black: 676#true, 916#true, 924#true, Black: 872#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 664#(= |#race~n3~0| 0), Black: 685#(not |thread1Thread1of1ForFork1_#t~short1|), 646#(= |#race~n1~0| 0), Black: 801#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 879#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 800#(<= ~n2~0 0), Black: 814#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#true, 933#true, 674#(= |#race~count2~0| 0), Black: 881#true, 705#(= |#race~get2~0| 0), Black: 744#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 670#(= |#race~count1~0| 0), Black: 757#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 749#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 743#(<= ~n2~0 0), Black: 751#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 697#(not |thread2Thread1of1ForFork0_#t~short10|), 771#true, 883#(= |#race~get3~0| 0), Black: 765#(not |thread3Thread1of1ForFork2_#t~short19|)]) [2025-03-08 22:06:44,083 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2025-03-08 22:06:44,083 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-08 22:06:44,083 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-08 22:06:44,083 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-08 22:06:44,083 INFO L124 PetriNetUnfolderBase]: 300/3535 cut-off events. [2025-03-08 22:06:44,083 INFO L125 PetriNetUnfolderBase]: For 310/352 co-relation queries the response was YES. [2025-03-08 22:06:44,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4806 conditions, 3535 events. 300/3535 cut-off events. For 310/352 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 27851 event pairs, 62 based on Foata normal form. 1/3371 useless extension candidates. Maximal degree in co-relation 4770. Up to 213 conditions per place. [2025-03-08 22:06:44,139 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 0 selfloop transitions, 0 changer transitions 554/554 dead transitions. [2025-03-08 22:06:44,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 554 transitions, 1456 flow [2025-03-08 22:06:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2025-03-08 22:06:44,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683773976153447 [2025-03-08 22:06:44,141 INFO L175 Difference]: Start difference. First operand has 589 places, 553 transitions, 1426 flow. Second operand 3 states and 1868 transitions. [2025-03-08 22:06:44,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 554 transitions, 1456 flow [2025-03-08 22:06:44,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 554 transitions, 1402 flow, removed 12 selfloop flow, removed 15 redundant places. [2025-03-08 22:06:44,148 INFO L231 Difference]: Finished difference. Result has 568 places, 0 transitions, 0 flow [2025-03-08 22:06:44,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=643, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=568, PETRI_TRANSITIONS=0} [2025-03-08 22:06:44,148 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -33 predicate places. [2025-03-08 22:06:44,148 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 0 transitions, 0 flow [2025-03-08 22:06:44,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 620.0) internal successors, (1860), 3 states have internal predecessors, (1860), 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:06:44,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (134 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (132 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (131 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (130 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (128 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (127 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (126 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (125 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (124 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (123 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (122 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (121 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (120 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (119 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (118 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (117 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (116 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (115 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (113 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (112 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (111 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (110 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (109 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (108 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (107 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (106 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (105 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (104 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (103 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 135 remaining) [2025-03-08 22:06:44,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (101 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (98 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (97 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (96 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (95 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (93 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (92 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (91 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (90 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (89 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (88 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (87 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (85 of 135 remaining) [2025-03-08 22:06:44,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (84 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (83 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (82 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (81 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (80 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (79 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (77 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (75 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (73 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (72 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (71 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (70 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (69 of 135 remaining) [2025-03-08 22:06:44,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (68 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (66 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (64 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (63 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (62 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (61 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (60 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (56 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (55 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (53 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (52 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (50 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (48 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (47 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (46 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (45 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (44 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (43 of 135 remaining) [2025-03-08 22:06:44,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (40 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (37 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (36 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (34 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (32 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (28 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (26 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (15 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (14 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (10 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (9 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 135 remaining) [2025-03-08 22:06:44,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 135 remaining) [2025-03-08 22:06:44,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 135 remaining) [2025-03-08 22:06:44,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 135 remaining) [2025-03-08 22:06:44,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 135 remaining) [2025-03-08 22:06:44,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 135 remaining) [2025-03-08 22:06:44,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 135 remaining) [2025-03-08 22:06:44,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 135 remaining) [2025-03-08 22:06:44,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 22:06:44,157 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-08 22:06:44,160 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:06:44,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:06:44,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:06:44 BasicIcfg [2025-03-08 22:06:44,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:06:44,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:06:44,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:06:44,165 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:06:44,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:48" (3/4) ... [2025-03-08 22:06:44,167 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:06:44,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:06:44,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:06:44,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 22:06:44,175 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-08 22:06:44,176 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:06:44,176 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:06:44,176 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:06:44,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:06:44,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:06:44,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:06:44,248 INFO L158 Benchmark]: Toolchain (without parser) took 57179.64ms. Allocated memory was 142.6MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 107.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-08 22:06:44,248 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:06:44,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.13ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:06:44,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.24ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:06:44,248 INFO L158 Benchmark]: Boogie Preprocessor took 38.82ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:06:44,249 INFO L158 Benchmark]: IcfgBuilder took 774.66ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 42.8MB in the end (delta: 45.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 22:06:44,249 INFO L158 Benchmark]: TraceAbstraction took 55993.07ms. Allocated memory was 142.6MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 41.8MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2025-03-08 22:06:44,249 INFO L158 Benchmark]: Witness Printer took 81.91ms. Allocated memory is still 3.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:06:44,250 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.13ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.24ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.82ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 88.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 774.66ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 42.8MB in the end (delta: 45.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 55993.07ms. Allocated memory was 142.6MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 41.8MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 81.91ms. Allocated memory is still 3.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 941 locations, 988 edges, 135 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 55.8s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 50.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6984 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4394 mSDsluCounter, 6917 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6440 mSDsCounter, 1346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11113 IncrementalHoareTripleChecker+Invalid, 12459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1346 mSolverCounterUnsat, 477 mSDtfsCounter, 11113 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1835occurred in iteration=38, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 8709 NumberOfCodeBlocks, 8709 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 8662 ConstructedInterpolants, 0 QuantifiedInterpolants, 10754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 PerfectInterpolantSequences, 29/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 75 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:06:44,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE