./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 09:29:47,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:29:47,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:29:47,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:29:47,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:29:47,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:29:47,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:29:47,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:29:47,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:29:47,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:29:47,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:29:47,560 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:29:47,561 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:29:47,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:29:47,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:29:47,561 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-jdk21/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-02-06 09:29:47,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:29:47,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:29:47,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:29:47,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:29:47,752 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:29:47,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-02-06 09:29:48,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/169ffc8e0/c5d9cb8993764b86b9d6070cf8d1b81d/FLAG2fd7dcb06 [2025-02-06 09:29:49,076 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:29:49,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-02-06 09:29:49,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/169ffc8e0/c5d9cb8993764b86b9d6070cf8d1b81d/FLAG2fd7dcb06 [2025-02-06 09:29:49,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/169ffc8e0/c5d9cb8993764b86b9d6070cf8d1b81d [2025-02-06 09:29:49,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:29:49,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:29:49,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:29:49,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:29:49,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:29:49,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e3f355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49, skipping insertion in model container [2025-02-06 09:29:49,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:29:49,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:29:49,280 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:29:49,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:29:49,336 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:29:49,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49 WrapperNode [2025-02-06 09:29:49,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:29:49,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:29:49,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:29:49,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:29:49,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,370 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 235 [2025-02-06 09:29:49,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:29:49,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:29:49,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:29:49,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:29:49,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:29:49,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:29:49,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:29:49,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:29:49,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (1/1) ... [2025-02-06 09:29:49,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:29:49,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:29:49,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:29:49,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:29:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:29:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:29:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:29:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:29:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:29:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:29:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:29:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:29:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:29:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:29:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:29:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:29:49,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:29:49,498 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:29:49,604 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:29:49,605 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:29:50,399 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:29:50,399 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:29:50,439 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:29:50,440 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:29:50,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:50 BoogieIcfgContainer [2025-02-06 09:29:50,440 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:29:50,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:29:50,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:29:50,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:29:50,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:29:49" (1/3) ... [2025-02-06 09:29:50,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b5d975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:29:50, skipping insertion in model container [2025-02-06 09:29:50,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:49" (2/3) ... [2025-02-06 09:29:50,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b5d975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:29:50, skipping insertion in model container [2025-02-06 09:29:50,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:50" (3/3) ... [2025-02-06 09:29:50,455 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-02-06 09:29:50,467 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:29:50,468 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-02-06 09:29:50,468 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:29:50,673 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:29:50,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 623 places, 643 transitions, 1307 flow [2025-02-06 09:29:50,970 INFO L124 PetriNetUnfolderBase]: 30/640 cut-off events. [2025-02-06 09:29:50,973 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:29:50,985 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-02-06 09:29:50,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 623 places, 643 transitions, 1307 flow [2025-02-06 09:29:50,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 601 places, 619 transitions, 1256 flow [2025-02-06 09:29:51,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:29:51,015 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;@53409a0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:29:51,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2025-02-06 09:29:51,020 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:29:51,020 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-02-06 09:29:51,020 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:29:51,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:51,022 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-02-06 09:29:51,022 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-02-06 09:29:51,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1286438478, now seen corresponding path program 1 times [2025-02-06 09:29:51,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825417071] [2025-02-06 09:29:51,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:51,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:29:51,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:29:51,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:51,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:51,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:51,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825417071] [2025-02-06 09:29:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825417071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:51,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:51,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509620881] [2025-02-06 09:29:51,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:51,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:51,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:51,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:51,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-06 09:29:51,249 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-02-06 09:29:51,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:51,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-06 09:29:51,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:51,598 INFO L124 PetriNetUnfolderBase]: 51/1065 cut-off events. [2025-02-06 09:29:51,598 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 09:29:51,604 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-02-06 09:29:51,612 INFO L140 encePairwiseOnDemand]: 631/643 looper letters, 13 selfloop transitions, 2 changer transitions 6/609 dead transitions. [2025-02-06 09:29:51,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 609 transitions, 1266 flow [2025-02-06 09:29:51,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-06 09:29:51,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-06 09:29:51,631 INFO L175 Difference]: Start difference. First operand has 601 places, 619 transitions, 1256 flow. Second operand 3 states and 1870 transitions. [2025-02-06 09:29:51,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 609 transitions, 1266 flow [2025-02-06 09:29:51,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:29:51,660 INFO L231 Difference]: Finished difference. Result has 596 places, 603 transitions, 1216 flow [2025-02-06 09:29:51,666 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-02-06 09:29:51,673 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -5 predicate places. [2025-02-06 09:29:51,673 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 603 transitions, 1216 flow [2025-02-06 09:29:51,674 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-02-06 09:29:51,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:51,674 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-02-06 09:29:51,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:29:51,674 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-02-06 09:29:51,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash 945220552, now seen corresponding path program 1 times [2025-02-06 09:29:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:51,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923037732] [2025-02-06 09:29:51,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:51,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 09:29:51,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 09:29:51,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:51,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:51,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:51,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923037732] [2025-02-06 09:29:51,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923037732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:51,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:51,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:51,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399058434] [2025-02-06 09:29:51,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:51,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:51,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:51,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:51,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:51,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-06 09:29:51,775 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-02-06 09:29:51,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:51,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-06 09:29:51,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:52,100 INFO L124 PetriNetUnfolderBase]: 79/1490 cut-off events. [2025-02-06 09:29:52,100 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:29:52,112 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-02-06 09:29:52,124 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2025-02-06 09:29:52,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 602 transitions, 1244 flow [2025-02-06 09:29:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-06 09:29:52,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-06 09:29:52,128 INFO L175 Difference]: Start difference. First operand has 596 places, 603 transitions, 1216 flow. Second operand 3 states and 1861 transitions. [2025-02-06 09:29:52,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 602 transitions, 1244 flow [2025-02-06 09:29:52,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 602 transitions, 1240 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:52,137 INFO L231 Difference]: Finished difference. Result has 589 places, 602 transitions, 1214 flow [2025-02-06 09:29:52,138 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-02-06 09:29:52,138 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -12 predicate places. [2025-02-06 09:29:52,139 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 602 transitions, 1214 flow [2025-02-06 09:29:52,140 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-02-06 09:29:52,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:52,140 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-02-06 09:29:52,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:29:52,140 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-02-06 09:29:52,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1743917730, now seen corresponding path program 1 times [2025-02-06 09:29:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:52,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028118180] [2025-02-06 09:29:52,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:52,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 09:29:52,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 09:29:52,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:52,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:52,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028118180] [2025-02-06 09:29:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028118180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783423484] [2025-02-06 09:29:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:52,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:52,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:52,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:52,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-06 09:29:52,217 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-02-06 09:29:52,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:52,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-06 09:29:52,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:52,500 INFO L124 PetriNetUnfolderBase]: 79/1477 cut-off events. [2025-02-06 09:29:52,501 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-02-06 09:29:52,508 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-02-06 09:29:52,515 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2025-02-06 09:29:52,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 601 transitions, 1242 flow [2025-02-06 09:29:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-06 09:29:52,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-06 09:29:52,519 INFO L175 Difference]: Start difference. First operand has 589 places, 602 transitions, 1214 flow. Second operand 3 states and 1861 transitions. [2025-02-06 09:29:52,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 601 transitions, 1242 flow [2025-02-06 09:29:52,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 601 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:52,526 INFO L231 Difference]: Finished difference. Result has 588 places, 601 transitions, 1212 flow [2025-02-06 09:29:52,526 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-02-06 09:29:52,527 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -13 predicate places. [2025-02-06 09:29:52,527 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 601 transitions, 1212 flow [2025-02-06 09:29:52,528 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-02-06 09:29:52,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:52,528 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-02-06 09:29:52,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:29:52,528 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-02-06 09:29:52,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1754749228, now seen corresponding path program 1 times [2025-02-06 09:29:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:52,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383882961] [2025-02-06 09:29:52,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:52,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 09:29:52,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 09:29:52,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:52,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383882961] [2025-02-06 09:29:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383882961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:52,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157703444] [2025-02-06 09:29:52,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:52,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:52,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:52,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:52,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-02-06 09:29:52,632 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-02-06 09:29:52,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:52,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-02-06 09:29:52,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:52,775 INFO L124 PetriNetUnfolderBase]: 51/1082 cut-off events. [2025-02-06 09:29:52,776 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-02-06 09:29:52,784 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-02-06 09:29:52,792 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 14 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2025-02-06 09:29:52,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 600 transitions, 1242 flow [2025-02-06 09:29:52,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:52,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2025-02-06 09:29:52,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637117677553136 [2025-02-06 09:29:52,795 INFO L175 Difference]: Start difference. First operand has 588 places, 601 transitions, 1212 flow. Second operand 3 states and 1859 transitions. [2025-02-06 09:29:52,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 600 transitions, 1242 flow [2025-02-06 09:29:52,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 600 transitions, 1238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:52,805 INFO L231 Difference]: Finished difference. Result has 587 places, 600 transitions, 1210 flow [2025-02-06 09:29:52,806 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-02-06 09:29:52,806 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -14 predicate places. [2025-02-06 09:29:52,807 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 600 transitions, 1210 flow [2025-02-06 09:29:52,808 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-02-06 09:29:52,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:52,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:52,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:29:52,808 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-02-06 09:29:52,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1627104303, now seen corresponding path program 1 times [2025-02-06 09:29:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:52,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543596748] [2025-02-06 09:29:52,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:52,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:52,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 09:29:52,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 09:29:52,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:52,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:52,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:52,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543596748] [2025-02-06 09:29:52,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543596748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:52,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:52,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:52,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461264161] [2025-02-06 09:29:52,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:52,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:52,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:52,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:52,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-02-06 09:29:52,903 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-02-06 09:29:52,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:52,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-02-06 09:29:52,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:53,123 INFO L124 PetriNetUnfolderBase]: 89/1777 cut-off events. [2025-02-06 09:29:53,124 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-02-06 09:29:53,135 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-02-06 09:29:53,146 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 14 selfloop transitions, 2 changer transitions 0/599 dead transitions. [2025-02-06 09:29:53,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 599 transitions, 1240 flow [2025-02-06 09:29:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2025-02-06 09:29:53,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637117677553136 [2025-02-06 09:29:53,150 INFO L175 Difference]: Start difference. First operand has 587 places, 600 transitions, 1210 flow. Second operand 3 states and 1859 transitions. [2025-02-06 09:29:53,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 599 transitions, 1240 flow [2025-02-06 09:29:53,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 599 transitions, 1236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:53,160 INFO L231 Difference]: Finished difference. Result has 586 places, 599 transitions, 1208 flow [2025-02-06 09:29:53,161 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-02-06 09:29:53,162 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -15 predicate places. [2025-02-06 09:29:53,163 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 599 transitions, 1208 flow [2025-02-06 09:29:53,164 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-02-06 09:29:53,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:53,164 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-02-06 09:29:53,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:29:53,165 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-02-06 09:29:53,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1900324397, now seen corresponding path program 1 times [2025-02-06 09:29:53,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:53,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669549513] [2025-02-06 09:29:53,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:53,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 09:29:53,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 09:29:53,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:53,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:53,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:53,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669549513] [2025-02-06 09:29:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669549513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:53,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585533642] [2025-02-06 09:29:53,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:53,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:53,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:53,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:53,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-02-06 09:29:53,256 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-02-06 09:29:53,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:53,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-02-06 09:29:53,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:53,394 INFO L124 PetriNetUnfolderBase]: 49/858 cut-off events. [2025-02-06 09:29:53,395 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-06 09:29:53,400 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-02-06 09:29:53,405 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 14 selfloop transitions, 2 changer transitions 0/598 dead transitions. [2025-02-06 09:29:53,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 598 transitions, 1238 flow [2025-02-06 09:29:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1859 transitions. [2025-02-06 09:29:53,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9637117677553136 [2025-02-06 09:29:53,408 INFO L175 Difference]: Start difference. First operand has 586 places, 599 transitions, 1208 flow. Second operand 3 states and 1859 transitions. [2025-02-06 09:29:53,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 598 transitions, 1238 flow [2025-02-06 09:29:53,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 598 transitions, 1234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:53,415 INFO L231 Difference]: Finished difference. Result has 585 places, 598 transitions, 1206 flow [2025-02-06 09:29:53,416 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-02-06 09:29:53,418 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -16 predicate places. [2025-02-06 09:29:53,419 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 598 transitions, 1206 flow [2025-02-06 09:29:53,420 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-02-06 09:29:53,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:53,420 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-02-06 09:29:53,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:29:53,420 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-02-06 09:29:53,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1455813863, now seen corresponding path program 1 times [2025-02-06 09:29:53,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:53,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670641864] [2025-02-06 09:29:53,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:53,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:53,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 09:29:53,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 09:29:53,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:53,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:53,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:53,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670641864] [2025-02-06 09:29:53,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670641864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:53,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:53,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496935677] [2025-02-06 09:29:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:53,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:53,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:53,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:53,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 643 [2025-02-06 09:29:53,496 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-02-06 09:29:53,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:53,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 643 [2025-02-06 09:29:53,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:53,675 INFO L124 PetriNetUnfolderBase]: 93/1474 cut-off events. [2025-02-06 09:29:53,675 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2025-02-06 09:29:53,689 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-02-06 09:29:53,698 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 16 selfloop transitions, 1 changer transitions 0/593 dead transitions. [2025-02-06 09:29:53,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 593 transitions, 1230 flow [2025-02-06 09:29:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-02-06 09:29:53,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.960082944530845 [2025-02-06 09:29:53,702 INFO L175 Difference]: Start difference. First operand has 585 places, 598 transitions, 1206 flow. Second operand 3 states and 1852 transitions. [2025-02-06 09:29:53,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 593 transitions, 1230 flow [2025-02-06 09:29:53,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 593 transitions, 1226 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:53,709 INFO L231 Difference]: Finished difference. Result has 580 places, 593 transitions, 1194 flow [2025-02-06 09:29:53,710 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-02-06 09:29:53,711 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2025-02-06 09:29:53,711 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 593 transitions, 1194 flow [2025-02-06 09:29:53,712 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-02-06 09:29:53,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:53,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:29:53,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:29:53,713 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-02-06 09:29:53,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:53,715 INFO L85 PathProgramCache]: Analyzing trace with hash 980813868, now seen corresponding path program 1 times [2025-02-06 09:29:53,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:53,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242641844] [2025-02-06 09:29:53,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:53,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:53,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 09:29:53,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 09:29:53,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:53,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:53,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242641844] [2025-02-06 09:29:53,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242641844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:53,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:53,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:53,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024135832] [2025-02-06 09:29:53,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:53,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:53,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:53,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:53,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-06 09:29:53,815 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-02-06 09:29:53,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:53,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-06 09:29:53,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:53,982 INFO L124 PetriNetUnfolderBase]: 51/1070 cut-off events. [2025-02-06 09:29:53,982 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-06 09:29:53,990 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-02-06 09:29:53,997 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2025-02-06 09:29:53,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 592 transitions, 1222 flow [2025-02-06 09:29:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-06 09:29:54,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-06 09:29:54,003 INFO L175 Difference]: Start difference. First operand has 580 places, 593 transitions, 1194 flow. Second operand 3 states and 1861 transitions. [2025-02-06 09:29:54,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 592 transitions, 1222 flow [2025-02-06 09:29:54,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 592 transitions, 1221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:29:54,013 INFO L231 Difference]: Finished difference. Result has 580 places, 592 transitions, 1195 flow [2025-02-06 09:29:54,015 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-02-06 09:29:54,015 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2025-02-06 09:29:54,015 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 592 transitions, 1195 flow [2025-02-06 09:29:54,017 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-02-06 09:29:54,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:54,018 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-02-06 09:29:54,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:29:54,018 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-02-06 09:29:54,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash 6015076, now seen corresponding path program 1 times [2025-02-06 09:29:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:54,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491710544] [2025-02-06 09:29:54,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:54,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:54,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 09:29:54,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 09:29:54,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:54,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:54,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:54,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491710544] [2025-02-06 09:29:54,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491710544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:54,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:54,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:29:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009400227] [2025-02-06 09:29:54,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:54,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:29:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:54,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:29:54,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:29:54,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 536 out of 643 [2025-02-06 09:29:54,885 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-02-06 09:29:54,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:54,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 536 of 643 [2025-02-06 09:29:54,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:00,856 INFO L124 PetriNetUnfolderBase]: 12846/49114 cut-off events. [2025-02-06 09:30:00,857 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2025-02-06 09:30:01,086 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-02-06 09:30:01,292 INFO L140 encePairwiseOnDemand]: 625/643 looper letters, 78 selfloop transitions, 15 changer transitions 0/589 dead transitions. [2025-02-06 09:30:01,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 589 transitions, 1375 flow [2025-02-06 09:30:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3312 transitions. [2025-02-06 09:30:01,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8584758942457231 [2025-02-06 09:30:01,298 INFO L175 Difference]: Start difference. First operand has 580 places, 592 transitions, 1195 flow. Second operand 6 states and 3312 transitions. [2025-02-06 09:30:01,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 589 transitions, 1375 flow [2025-02-06 09:30:01,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 589 transitions, 1371 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:01,305 INFO L231 Difference]: Finished difference. Result has 580 places, 589 transitions, 1215 flow [2025-02-06 09:30:01,306 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-02-06 09:30:01,307 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -21 predicate places. [2025-02-06 09:30:01,307 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 589 transitions, 1215 flow [2025-02-06 09:30:01,308 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-02-06 09:30:01,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:01,309 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-02-06 09:30:01,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:30:01,309 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-02-06 09:30:01,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2068764731, now seen corresponding path program 1 times [2025-02-06 09:30:01,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:01,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113347963] [2025-02-06 09:30:01,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:01,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:30:01,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:30:01,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:01,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113347963] [2025-02-06 09:30:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113347963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:01,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312481646] [2025-02-06 09:30:01,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:01,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:01,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:01,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:01,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 643 [2025-02-06 09:30:01,388 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-02-06 09:30:01,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:01,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 643 [2025-02-06 09:30:01,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:01,755 INFO L124 PetriNetUnfolderBase]: 184/2390 cut-off events. [2025-02-06 09:30:01,755 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2025-02-06 09:30:01,767 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-02-06 09:30:01,776 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 16 selfloop transitions, 1 changer transitions 0/584 dead transitions. [2025-02-06 09:30:01,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 584 transitions, 1239 flow [2025-02-06 09:30:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-02-06 09:30:01,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.960082944530845 [2025-02-06 09:30:01,780 INFO L175 Difference]: Start difference. First operand has 580 places, 589 transitions, 1215 flow. Second operand 3 states and 1852 transitions. [2025-02-06 09:30:01,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 584 transitions, 1239 flow [2025-02-06 09:30:01,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 584 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:30:01,785 INFO L231 Difference]: Finished difference. Result has 572 places, 584 transitions, 1177 flow [2025-02-06 09:30:01,786 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-02-06 09:30:01,787 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2025-02-06 09:30:01,787 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 584 transitions, 1177 flow [2025-02-06 09:30:01,788 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-02-06 09:30:01,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:01,788 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-02-06 09:30:01,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:30:01,788 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-02-06 09:30:01,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:01,789 INFO L85 PathProgramCache]: Analyzing trace with hash -416426763, now seen corresponding path program 1 times [2025-02-06 09:30:01,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:01,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236034473] [2025-02-06 09:30:01,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:01,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:01,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 09:30:01,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 09:30:01,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:01,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:01,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:01,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236034473] [2025-02-06 09:30:01,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236034473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:01,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:01,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:01,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636273416] [2025-02-06 09:30:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:01,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:01,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:01,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:01,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-06 09:30:01,854 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-02-06 09:30:01,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:01,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-06 09:30:01,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:02,015 INFO L124 PetriNetUnfolderBase]: 89/1741 cut-off events. [2025-02-06 09:30:02,016 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-06 09:30:02,027 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-02-06 09:30:02,035 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2025-02-06 09:30:02,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 583 transitions, 1205 flow [2025-02-06 09:30:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-06 09:30:02,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-06 09:30:02,038 INFO L175 Difference]: Start difference. First operand has 572 places, 584 transitions, 1177 flow. Second operand 3 states and 1861 transitions. [2025-02-06 09:30:02,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 583 transitions, 1205 flow [2025-02-06 09:30:02,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 583 transitions, 1204 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:02,045 INFO L231 Difference]: Finished difference. Result has 572 places, 583 transitions, 1178 flow [2025-02-06 09:30:02,046 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-02-06 09:30:02,046 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -29 predicate places. [2025-02-06 09:30:02,047 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 583 transitions, 1178 flow [2025-02-06 09:30:02,048 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-02-06 09:30:02,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:02,048 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-02-06 09:30:02,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:30:02,048 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-02-06 09:30:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1129298010, now seen corresponding path program 1 times [2025-02-06 09:30:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638921410] [2025-02-06 09:30:02,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:02,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 09:30:02,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 09:30:02,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:02,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:02,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:02,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638921410] [2025-02-06 09:30:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638921410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:02,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589210339] [2025-02-06 09:30:02,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:02,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:02,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:02,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:02,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 610 out of 643 [2025-02-06 09:30:02,111 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-02-06 09:30:02,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:02,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 610 of 643 [2025-02-06 09:30:02,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:02,311 INFO L124 PetriNetUnfolderBase]: 167/1866 cut-off events. [2025-02-06 09:30:02,311 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2025-02-06 09:30:02,327 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-02-06 09:30:02,338 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 16 selfloop transitions, 1 changer transitions 0/578 dead transitions. [2025-02-06 09:30:02,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 578 transitions, 1202 flow [2025-02-06 09:30:02,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2025-02-06 09:30:02,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.960082944530845 [2025-02-06 09:30:02,341 INFO L175 Difference]: Start difference. First operand has 572 places, 583 transitions, 1178 flow. Second operand 3 states and 1852 transitions. [2025-02-06 09:30:02,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 578 transitions, 1202 flow [2025-02-06 09:30:02,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 578 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:02,347 INFO L231 Difference]: Finished difference. Result has 567 places, 578 transitions, 1166 flow [2025-02-06 09:30:02,349 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-02-06 09:30:02,349 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2025-02-06 09:30:02,349 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 578 transitions, 1166 flow [2025-02-06 09:30:02,352 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-02-06 09:30:02,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:02,352 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-02-06 09:30:02,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:30:02,352 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-02-06 09:30:02,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash 789927415, now seen corresponding path program 1 times [2025-02-06 09:30:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:02,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637141210] [2025-02-06 09:30:02,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:02,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:02,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 09:30:02,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 09:30:02,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:02,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637141210] [2025-02-06 09:30:02,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637141210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:02,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:02,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:02,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709738387] [2025-02-06 09:30:02,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:02,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:02,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:02,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:02,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 615 out of 643 [2025-02-06 09:30:02,429 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-02-06 09:30:02,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:02,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 615 of 643 [2025-02-06 09:30:02,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:02,515 INFO L124 PetriNetUnfolderBase]: 49/829 cut-off events. [2025-02-06 09:30:02,515 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-06 09:30:02,522 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-02-06 09:30:02,526 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2025-02-06 09:30:02,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 577 transitions, 1194 flow [2025-02-06 09:30:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2025-02-06 09:30:02,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9647485743908761 [2025-02-06 09:30:02,529 INFO L175 Difference]: Start difference. First operand has 567 places, 578 transitions, 1166 flow. Second operand 3 states and 1861 transitions. [2025-02-06 09:30:02,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 577 transitions, 1194 flow [2025-02-06 09:30:02,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 577 transitions, 1193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:02,535 INFO L231 Difference]: Finished difference. Result has 567 places, 577 transitions, 1167 flow [2025-02-06 09:30:02,535 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-02-06 09:30:02,536 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -34 predicate places. [2025-02-06 09:30:02,536 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 577 transitions, 1167 flow [2025-02-06 09:30:02,538 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-02-06 09:30:02,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:02,538 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-02-06 09:30:02,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:30:02,538 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-02-06 09:30:02,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2115546490, now seen corresponding path program 1 times [2025-02-06 09:30:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580969845] [2025-02-06 09:30:02,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:02,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 09:30:02,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 09:30:02,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:02,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:02,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:02,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580969845] [2025-02-06 09:30:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580969845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:02,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:02,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111500383] [2025-02-06 09:30:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:02,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:02,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:02,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:02,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-06 09:30:02,600 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-02-06 09:30:02,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:02,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-06 09:30:02,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:02,874 INFO L124 PetriNetUnfolderBase]: 96/1554 cut-off events. [2025-02-06 09:30:02,874 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 09:30:02,886 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-02-06 09:30:02,894 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 17 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2025-02-06 09:30:02,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 577 transitions, 1207 flow [2025-02-06 09:30:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2025-02-06 09:30:02,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652669777086573 [2025-02-06 09:30:02,898 INFO L175 Difference]: Start difference. First operand has 567 places, 577 transitions, 1167 flow. Second operand 3 states and 1862 transitions. [2025-02-06 09:30:02,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 577 transitions, 1207 flow [2025-02-06 09:30:02,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 577 transitions, 1203 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:02,909 INFO L231 Difference]: Finished difference. Result has 564 places, 575 transitions, 1169 flow [2025-02-06 09:30:02,910 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-02-06 09:30:02,911 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2025-02-06 09:30:02,911 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 575 transitions, 1169 flow [2025-02-06 09:30:02,912 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-02-06 09:30:02,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:02,913 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-02-06 09:30:02,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:30:02,913 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-02-06 09:30:02,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1520605593, now seen corresponding path program 1 times [2025-02-06 09:30:02,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:02,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883578934] [2025-02-06 09:30:02,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:02,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:02,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-06 09:30:02,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-06 09:30:02,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:02,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:02,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883578934] [2025-02-06 09:30:02,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883578934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:02,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:02,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24078418] [2025-02-06 09:30:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:02,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:02,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:02,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:02,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-06 09:30:02,993 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-02-06 09:30:02,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:02,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-06 09:30:02,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:03,307 INFO L124 PetriNetUnfolderBase]: 165/2322 cut-off events. [2025-02-06 09:30:03,307 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:30:03,324 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-02-06 09:30:03,335 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 17 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-02-06 09:30:03,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 575 transitions, 1209 flow [2025-02-06 09:30:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2025-02-06 09:30:03,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652669777086573 [2025-02-06 09:30:03,338 INFO L175 Difference]: Start difference. First operand has 564 places, 575 transitions, 1169 flow. Second operand 3 states and 1862 transitions. [2025-02-06 09:30:03,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 575 transitions, 1209 flow [2025-02-06 09:30:03,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 575 transitions, 1209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:03,345 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1175 flow [2025-02-06 09:30:03,345 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-02-06 09:30:03,346 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2025-02-06 09:30:03,346 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1175 flow [2025-02-06 09:30:03,347 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-02-06 09:30:03,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:03,347 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-02-06 09:30:03,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:30:03,347 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-02-06 09:30:03,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:03,348 INFO L85 PathProgramCache]: Analyzing trace with hash -539882312, now seen corresponding path program 1 times [2025-02-06 09:30:03,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:03,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194084306] [2025-02-06 09:30:03,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:03,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:03,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-06 09:30:03,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-06 09:30:03,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:03,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194084306] [2025-02-06 09:30:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194084306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:03,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:03,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027663458] [2025-02-06 09:30:03,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:03,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:03,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:03,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:03,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-06 09:30:03,425 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-02-06 09:30:03,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:03,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-06 09:30:03,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:03,856 INFO L124 PetriNetUnfolderBase]: 251/3259 cut-off events. [2025-02-06 09:30:03,856 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2025-02-06 09:30:03,876 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-02-06 09:30:03,889 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 17 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2025-02-06 09:30:03,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 573 transitions, 1215 flow [2025-02-06 09:30:03,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1862 transitions. [2025-02-06 09:30:03,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652669777086573 [2025-02-06 09:30:03,892 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1175 flow. Second operand 3 states and 1862 transitions. [2025-02-06 09:30:03,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 573 transitions, 1215 flow [2025-02-06 09:30:03,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 573 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:03,900 INFO L231 Difference]: Finished difference. Result has 562 places, 571 transitions, 1181 flow [2025-02-06 09:30:03,900 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-02-06 09:30:03,901 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2025-02-06 09:30:03,901 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 571 transitions, 1181 flow [2025-02-06 09:30:03,902 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-02-06 09:30:03,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:03,903 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-02-06 09:30:03,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:30:03,903 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-02-06 09:30:03,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash 914156827, now seen corresponding path program 1 times [2025-02-06 09:30:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486222500] [2025-02-06 09:30:03,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:03,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:03,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 09:30:03,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 09:30:03,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:03,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:03,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486222500] [2025-02-06 09:30:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486222500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896932469] [2025-02-06 09:30:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:03,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:03,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:03,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:03,973 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-02-06 09:30:03,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:03,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:03,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:04,276 INFO L124 PetriNetUnfolderBase]: 109/2049 cut-off events. [2025-02-06 09:30:04,276 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-02-06 09:30:04,290 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-02-06 09:30:04,298 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2025-02-06 09:30:04,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 572 transitions, 1215 flow [2025-02-06 09:30:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-06 09:30:04,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-06 09:30:04,302 INFO L175 Difference]: Start difference. First operand has 562 places, 571 transitions, 1181 flow. Second operand 3 states and 1870 transitions. [2025-02-06 09:30:04,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 572 transitions, 1215 flow [2025-02-06 09:30:04,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 572 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:04,309 INFO L231 Difference]: Finished difference. Result has 563 places, 570 transitions, 1183 flow [2025-02-06 09:30:04,309 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-02-06 09:30:04,309 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2025-02-06 09:30:04,310 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 570 transitions, 1183 flow [2025-02-06 09:30:04,313 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-02-06 09:30:04,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:04,314 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-02-06 09:30:04,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:30:04,314 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-02-06 09:30:04,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1663914528, now seen corresponding path program 1 times [2025-02-06 09:30:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:04,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858120021] [2025-02-06 09:30:04,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:04,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 09:30:04,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 09:30:04,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:04,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858120021] [2025-02-06 09:30:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858120021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:04,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:04,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:30:04,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154606948] [2025-02-06 09:30:04,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:04,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:04,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:04,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:04,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:04,393 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-02-06 09:30:04,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:04,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:04,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:04,631 INFO L124 PetriNetUnfolderBase]: 90/1581 cut-off events. [2025-02-06 09:30:04,632 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-06 09:30:04,644 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-02-06 09:30:04,651 INFO L140 encePairwiseOnDemand]: 639/643 looper letters, 14 selfloop transitions, 3 changer transitions 0/573 dead transitions. [2025-02-06 09:30:04,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1225 flow [2025-02-06 09:30:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-06 09:30:04,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-06 09:30:04,654 INFO L175 Difference]: Start difference. First operand has 563 places, 570 transitions, 1183 flow. Second operand 3 states and 1872 transitions. [2025-02-06 09:30:04,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1225 flow [2025-02-06 09:30:04,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1221 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:04,664 INFO L231 Difference]: Finished difference. Result has 565 places, 571 transitions, 1197 flow [2025-02-06 09:30:04,664 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-02-06 09:30:04,665 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2025-02-06 09:30:04,665 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 571 transitions, 1197 flow [2025-02-06 09:30:04,665 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-02-06 09:30:04,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:04,665 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-02-06 09:30:04,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:30:04,666 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-02-06 09:30:04,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:04,666 INFO L85 PathProgramCache]: Analyzing trace with hash 147078821, now seen corresponding path program 1 times [2025-02-06 09:30:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777652956] [2025-02-06 09:30:04,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:04,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 09:30:04,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 09:30:04,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:04,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:04,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777652956] [2025-02-06 09:30:04,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777652956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:04,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:04,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:04,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274650358] [2025-02-06 09:30:04,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:04,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:04,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:04,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:04,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:04,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-06 09:30:04,750 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-02-06 09:30:04,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:04,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-06 09:30:04,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:05,179 INFO L124 PetriNetUnfolderBase]: 198/2668 cut-off events. [2025-02-06 09:30:05,180 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2025-02-06 09:30:05,204 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-02-06 09:30:05,217 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 20 selfloop transitions, 2 changer transitions 0/574 dead transitions. [2025-02-06 09:30:05,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 574 transitions, 1252 flow [2025-02-06 09:30:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2025-02-06 09:30:05,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966822187662001 [2025-02-06 09:30:05,220 INFO L175 Difference]: Start difference. First operand has 565 places, 571 transitions, 1197 flow. Second operand 3 states and 1865 transitions. [2025-02-06 09:30:05,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 574 transitions, 1252 flow [2025-02-06 09:30:05,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 574 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:05,229 INFO L231 Difference]: Finished difference. Result has 562 places, 569 transitions, 1197 flow [2025-02-06 09:30:05,230 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-02-06 09:30:05,230 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -39 predicate places. [2025-02-06 09:30:05,230 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 569 transitions, 1197 flow [2025-02-06 09:30:05,231 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-02-06 09:30:05,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:05,231 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-02-06 09:30:05,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:30:05,231 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-02-06 09:30:05,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash -694494757, now seen corresponding path program 1 times [2025-02-06 09:30:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:05,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477715397] [2025-02-06 09:30:05,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:05,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-06 09:30:05,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-06 09:30:05,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:05,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477715397] [2025-02-06 09:30:05,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477715397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:05,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:05,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:05,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007491965] [2025-02-06 09:30:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:05,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:05,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:05,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:05,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:05,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:05,302 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-02-06 09:30:05,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:05,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:05,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:05,743 INFO L124 PetriNetUnfolderBase]: 184/2913 cut-off events. [2025-02-06 09:30:05,743 INFO L125 PetriNetUnfolderBase]: For 18/69 co-relation queries the response was YES. [2025-02-06 09:30:05,765 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-02-06 09:30:05,777 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-02-06 09:30:05,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 570 transitions, 1231 flow [2025-02-06 09:30:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-06 09:30:05,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-06 09:30:05,781 INFO L175 Difference]: Start difference. First operand has 562 places, 569 transitions, 1197 flow. Second operand 3 states and 1870 transitions. [2025-02-06 09:30:05,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 563 places, 570 transitions, 1231 flow [2025-02-06 09:30:05,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 570 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:05,788 INFO L231 Difference]: Finished difference. Result has 563 places, 568 transitions, 1199 flow [2025-02-06 09:30:05,788 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-02-06 09:30:05,789 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -38 predicate places. [2025-02-06 09:30:05,789 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 568 transitions, 1199 flow [2025-02-06 09:30:05,789 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-02-06 09:30:05,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:05,789 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-02-06 09:30:05,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:30:05,790 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-02-06 09:30:05,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash 7494033, now seen corresponding path program 1 times [2025-02-06 09:30:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303236433] [2025-02-06 09:30:05,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:05,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-06 09:30:05,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-06 09:30:05,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:05,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:05,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:05,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303236433] [2025-02-06 09:30:05,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303236433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:05,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:05,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:30:05,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936522728] [2025-02-06 09:30:05,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:05,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:05,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:05,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:05,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:05,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:05,849 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-02-06 09:30:05,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:05,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:05,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:06,223 INFO L124 PetriNetUnfolderBase]: 154/2283 cut-off events. [2025-02-06 09:30:06,223 INFO L125 PetriNetUnfolderBase]: For 21/54 co-relation queries the response was YES. [2025-02-06 09:30:06,247 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-02-06 09:30:06,258 INFO L140 encePairwiseOnDemand]: 639/643 looper letters, 14 selfloop transitions, 3 changer transitions 0/571 dead transitions. [2025-02-06 09:30:06,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 571 transitions, 1241 flow [2025-02-06 09:30:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-06 09:30:06,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-06 09:30:06,262 INFO L175 Difference]: Start difference. First operand has 563 places, 568 transitions, 1199 flow. Second operand 3 states and 1872 transitions. [2025-02-06 09:30:06,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 571 transitions, 1241 flow [2025-02-06 09:30:06,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 571 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:06,269 INFO L231 Difference]: Finished difference. Result has 565 places, 569 transitions, 1213 flow [2025-02-06 09:30:06,270 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-02-06 09:30:06,270 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -36 predicate places. [2025-02-06 09:30:06,270 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 569 transitions, 1213 flow [2025-02-06 09:30:06,271 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-02-06 09:30:06,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:06,271 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-02-06 09:30:06,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:30:06,271 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-02-06 09:30:06,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash -431289747, now seen corresponding path program 1 times [2025-02-06 09:30:06,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:06,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118187668] [2025-02-06 09:30:06,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:06,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-06 09:30:06,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-06 09:30:06,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:06,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:06,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:06,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118187668] [2025-02-06 09:30:06,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118187668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:06,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679865530] [2025-02-06 09:30:06,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:06,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:06,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:06,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:06,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:06,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:06,351 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-02-06 09:30:06,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:06,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:06,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:06,767 INFO L124 PetriNetUnfolderBase]: 162/2662 cut-off events. [2025-02-06 09:30:06,767 INFO L125 PetriNetUnfolderBase]: For 18/24 co-relation queries the response was YES. [2025-02-06 09:30:06,789 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-02-06 09:30:06,800 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-02-06 09:30:06,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 570 transitions, 1247 flow [2025-02-06 09:30:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-06 09:30:06,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-06 09:30:06,803 INFO L175 Difference]: Start difference. First operand has 565 places, 569 transitions, 1213 flow. Second operand 3 states and 1870 transitions. [2025-02-06 09:30:06,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 570 transitions, 1247 flow [2025-02-06 09:30:06,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 570 transitions, 1241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:06,811 INFO L231 Difference]: Finished difference. Result has 564 places, 568 transitions, 1209 flow [2025-02-06 09:30:06,812 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-02-06 09:30:06,812 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -37 predicate places. [2025-02-06 09:30:06,812 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 568 transitions, 1209 flow [2025-02-06 09:30:06,813 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-02-06 09:30:06,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:06,813 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-02-06 09:30:06,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:30:06,813 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-02-06 09:30:06,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1523769253, now seen corresponding path program 1 times [2025-02-06 09:30:06,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:06,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670073478] [2025-02-06 09:30:06,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:06,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:06,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 09:30:06,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 09:30:06,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:06,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:06,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-02-06 09:30:06,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:06,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670073478] [2025-02-06 09:30:06,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670073478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:06,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:06,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:06,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043573028] [2025-02-06 09:30:06,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:06,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:06,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:06,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:06,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:06,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-06 09:30:06,876 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-02-06 09:30:06,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:06,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-06 09:30:06,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:07,466 INFO L124 PetriNetUnfolderBase]: 248/3369 cut-off events. [2025-02-06 09:30:07,466 INFO L125 PetriNetUnfolderBase]: For 15/29 co-relation queries the response was YES. [2025-02-06 09:30:07,503 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-02-06 09:30:07,521 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 20 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2025-02-06 09:30:07,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 571 transitions, 1264 flow [2025-02-06 09:30:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1865 transitions. [2025-02-06 09:30:07,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966822187662001 [2025-02-06 09:30:07,524 INFO L175 Difference]: Start difference. First operand has 564 places, 568 transitions, 1209 flow. Second operand 3 states and 1865 transitions. [2025-02-06 09:30:07,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 571 transitions, 1264 flow [2025-02-06 09:30:07,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 571 transitions, 1260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:07,532 INFO L231 Difference]: Finished difference. Result has 561 places, 566 transitions, 1211 flow [2025-02-06 09:30:07,532 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-02-06 09:30:07,533 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -40 predicate places. [2025-02-06 09:30:07,533 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 566 transitions, 1211 flow [2025-02-06 09:30:07,534 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-02-06 09:30:07,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:07,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] [2025-02-06 09:30:07,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:30:07,534 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-02-06 09:30:07,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1095101675, now seen corresponding path program 1 times [2025-02-06 09:30:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002129342] [2025-02-06 09:30:07,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:07,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 09:30:07,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 09:30:07,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:07,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:07,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002129342] [2025-02-06 09:30:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002129342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:07,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:07,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:30:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486076734] [2025-02-06 09:30:07,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:07,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:30:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:07,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:30:07,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:30:08,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-06 09:30:08,223 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-02-06 09:30:08,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:08,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-06 09:30:08,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:09,022 INFO L124 PetriNetUnfolderBase]: 311/4433 cut-off events. [2025-02-06 09:30:09,022 INFO L125 PetriNetUnfolderBase]: For 14/41 co-relation queries the response was YES. [2025-02-06 09:30:09,070 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-02-06 09:30:09,089 INFO L140 encePairwiseOnDemand]: 628/643 looper letters, 70 selfloop transitions, 16 changer transitions 0/605 dead transitions. [2025-02-06 09:30:09,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 605 transitions, 1477 flow [2025-02-06 09:30:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:30:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:30:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6532 transitions. [2025-02-06 09:30:09,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9235119468400962 [2025-02-06 09:30:09,096 INFO L175 Difference]: Start difference. First operand has 561 places, 566 transitions, 1211 flow. Second operand 11 states and 6532 transitions. [2025-02-06 09:30:09,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 605 transitions, 1477 flow [2025-02-06 09:30:09,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 605 transitions, 1477 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:09,104 INFO L231 Difference]: Finished difference. Result has 576 places, 575 transitions, 1295 flow [2025-02-06 09:30:09,104 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-02-06 09:30:09,105 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2025-02-06 09:30:09,105 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 575 transitions, 1295 flow [2025-02-06 09:30:09,106 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-02-06 09:30:09,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:09,106 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-02-06 09:30:09,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:30:09,106 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-02-06 09:30:09,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2135672182, now seen corresponding path program 1 times [2025-02-06 09:30:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129598559] [2025-02-06 09:30:09,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:09,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 09:30:09,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 09:30:09,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:09,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:09,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:09,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129598559] [2025-02-06 09:30:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129598559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951524543] [2025-02-06 09:30:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:09,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:09,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:09,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:09,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:09,154 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-02-06 09:30:09,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:09,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:09,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:09,545 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-02-06 09:30:09,546 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2025-02-06 09:30:09,546 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2025-02-06 09:30:09,546 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2025-02-06 09:30:09,546 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is not cut-off event [2025-02-06 09:30:09,554 INFO L124 PetriNetUnfolderBase]: 261/3042 cut-off events. [2025-02-06 09:30:09,554 INFO L125 PetriNetUnfolderBase]: For 84/129 co-relation queries the response was YES. [2025-02-06 09:30:09,586 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-02-06 09:30:09,598 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2025-02-06 09:30:09,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 576 transitions, 1329 flow [2025-02-06 09:30:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-06 09:30:09,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-06 09:30:09,601 INFO L175 Difference]: Start difference. First operand has 576 places, 575 transitions, 1295 flow. Second operand 3 states and 1870 transitions. [2025-02-06 09:30:09,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 576 transitions, 1329 flow [2025-02-06 09:30:09,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 576 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:09,607 INFO L231 Difference]: Finished difference. Result has 576 places, 574 transitions, 1293 flow [2025-02-06 09:30:09,608 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-02-06 09:30:09,608 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -25 predicate places. [2025-02-06 09:30:09,609 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 574 transitions, 1293 flow [2025-02-06 09:30:09,609 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-02-06 09:30:09,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:09,609 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-02-06 09:30:09,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 09:30:09,610 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-02-06 09:30:09,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1873182110, now seen corresponding path program 1 times [2025-02-06 09:30:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880154166] [2025-02-06 09:30:09,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:09,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-06 09:30:09,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-06 09:30:09,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:09,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:09,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880154166] [2025-02-06 09:30:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880154166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:09,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:09,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998421271] [2025-02-06 09:30:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:09,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:09,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:09,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:09,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:09,671 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-02-06 09:30:09,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:09,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:09,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:10,423 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-02-06 09:30:10,423 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2025-02-06 09:30:10,424 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-02-06 09:30:10,424 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-06 09:30:10,424 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-02-06 09:30:10,521 INFO L124 PetriNetUnfolderBase]: 442/6407 cut-off events. [2025-02-06 09:30:10,521 INFO L125 PetriNetUnfolderBase]: For 57/115 co-relation queries the response was YES. [2025-02-06 09:30:10,578 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-02-06 09:30:10,601 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2025-02-06 09:30:10,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 575 transitions, 1327 flow [2025-02-06 09:30:10,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-06 09:30:10,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-06 09:30:10,604 INFO L175 Difference]: Start difference. First operand has 576 places, 574 transitions, 1293 flow. Second operand 3 states and 1870 transitions. [2025-02-06 09:30:10,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 575 transitions, 1327 flow [2025-02-06 09:30:10,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 575 transitions, 1323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:10,611 INFO L231 Difference]: Finished difference. Result has 575 places, 573 transitions, 1291 flow [2025-02-06 09:30:10,611 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-02-06 09:30:10,612 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -26 predicate places. [2025-02-06 09:30:10,612 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 573 transitions, 1291 flow [2025-02-06 09:30:10,612 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-02-06 09:30:10,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:10,612 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-02-06 09:30:10,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:30:10,613 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-02-06 09:30:10,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash -480714677, now seen corresponding path program 1 times [2025-02-06 09:30:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:10,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833303055] [2025-02-06 09:30:10,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:10,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 09:30:10,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 09:30:10,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:10,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:10,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833303055] [2025-02-06 09:30:10,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833303055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:10,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:10,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:30:10,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999977413] [2025-02-06 09:30:10,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:10,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:30:10,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:10,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:30:10,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:30:11,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-06 09:30:11,165 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-02-06 09:30:11,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:11,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-06 09:30:11,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:12,387 INFO L124 PetriNetUnfolderBase]: 701/8589 cut-off events. [2025-02-06 09:30:12,387 INFO L125 PetriNetUnfolderBase]: For 148/265 co-relation queries the response was YES. [2025-02-06 09:30:12,469 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-02-06 09:30:12,503 INFO L140 encePairwiseOnDemand]: 628/643 looper letters, 66 selfloop transitions, 16 changer transitions 0/603 dead transitions. [2025-02-06 09:30:12,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 603 transitions, 1531 flow [2025-02-06 09:30:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:30:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:30:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6523 transitions. [2025-02-06 09:30:12,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9222395023328149 [2025-02-06 09:30:12,510 INFO L175 Difference]: Start difference. First operand has 575 places, 573 transitions, 1291 flow. Second operand 11 states and 6523 transitions. [2025-02-06 09:30:12,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 603 transitions, 1531 flow [2025-02-06 09:30:12,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 603 transitions, 1527 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:12,518 INFO L231 Difference]: Finished difference. Result has 588 places, 582 transitions, 1371 flow [2025-02-06 09:30:12,519 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-02-06 09:30:12,519 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -13 predicate places. [2025-02-06 09:30:12,519 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 582 transitions, 1371 flow [2025-02-06 09:30:12,520 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-02-06 09:30:12,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:12,520 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-02-06 09:30:12,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 09:30:12,521 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-02-06 09:30:12,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash 397431629, now seen corresponding path program 1 times [2025-02-06 09:30:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400216590] [2025-02-06 09:30:12,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:12,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:12,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-06 09:30:12,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-06 09:30:12,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:12,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:12,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400216590] [2025-02-06 09:30:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400216590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:12,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:30:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190810306] [2025-02-06 09:30:12,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:12,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:12,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:12,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:12,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:12,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:12,560 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-02-06 09:30:12,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:12,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:12,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:13,476 INFO L124 PetriNetUnfolderBase]: 700/6568 cut-off events. [2025-02-06 09:30:13,476 INFO L125 PetriNetUnfolderBase]: For 363/434 co-relation queries the response was YES. [2025-02-06 09:30:13,546 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-02-06 09:30:13,575 INFO L140 encePairwiseOnDemand]: 639/643 looper letters, 14 selfloop transitions, 3 changer transitions 0/585 dead transitions. [2025-02-06 09:30:13,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 585 transitions, 1413 flow [2025-02-06 09:30:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-06 09:30:13,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-06 09:30:13,578 INFO L175 Difference]: Start difference. First operand has 588 places, 582 transitions, 1371 flow. Second operand 3 states and 1872 transitions. [2025-02-06 09:30:13,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 585 transitions, 1413 flow [2025-02-06 09:30:13,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 585 transitions, 1409 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:13,586 INFO L231 Difference]: Finished difference. Result has 591 places, 583 transitions, 1385 flow [2025-02-06 09:30:13,587 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-02-06 09:30:13,588 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -10 predicate places. [2025-02-06 09:30:13,588 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 583 transitions, 1385 flow [2025-02-06 09:30:13,588 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-02-06 09:30:13,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:13,588 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-02-06 09:30:13,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 09:30:13,589 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-02-06 09:30:13,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:13,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1304459348, now seen corresponding path program 1 times [2025-02-06 09:30:13,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:13,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268783373] [2025-02-06 09:30:13,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:13,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-06 09:30:13,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-06 09:30:13,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:13,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:13,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:13,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268783373] [2025-02-06 09:30:13,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268783373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:13,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:13,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:13,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107999092] [2025-02-06 09:30:13,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:13,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:13,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:13,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:13,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:13,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:13,636 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-02-06 09:30:13,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:13,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:13,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:14,352 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-02-06 09:30:14,352 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-02-06 09:30:14,352 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2025-02-06 09:30:14,352 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-02-06 09:30:14,352 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-02-06 09:30:14,360 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-02-06 09:30:14,361 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is not cut-off event [2025-02-06 09:30:14,361 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2025-02-06 09:30:14,361 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is not cut-off event [2025-02-06 09:30:14,361 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is not cut-off event [2025-02-06 09:30:14,371 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-02-06 09:30:14,372 INFO L294 olderBase$Statistics]: this new event has 318 ancestors and is cut-off event [2025-02-06 09:30:14,372 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-02-06 09:30:14,372 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-02-06 09:30:14,372 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-02-06 09:30:14,372 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-02-06 09:30:14,376 INFO L124 PetriNetUnfolderBase]: 493/5346 cut-off events. [2025-02-06 09:30:14,376 INFO L125 PetriNetUnfolderBase]: For 288/357 co-relation queries the response was YES. [2025-02-06 09:30:14,426 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-02-06 09:30:14,444 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 13 selfloop transitions, 2 changer transitions 0/584 dead transitions. [2025-02-06 09:30:14,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 584 transitions, 1419 flow [2025-02-06 09:30:14,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2025-02-06 09:30:14,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9694142042509072 [2025-02-06 09:30:14,446 INFO L175 Difference]: Start difference. First operand has 591 places, 583 transitions, 1385 flow. Second operand 3 states and 1870 transitions. [2025-02-06 09:30:14,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 584 transitions, 1419 flow [2025-02-06 09:30:14,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 584 transitions, 1413 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:14,455 INFO L231 Difference]: Finished difference. Result has 590 places, 582 transitions, 1381 flow [2025-02-06 09:30:14,455 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-02-06 09:30:14,456 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -11 predicate places. [2025-02-06 09:30:14,456 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 582 transitions, 1381 flow [2025-02-06 09:30:14,456 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-02-06 09:30:14,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:14,457 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-02-06 09:30:14,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 09:30:14,457 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-02-06 09:30:14,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -931251002, now seen corresponding path program 1 times [2025-02-06 09:30:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377052648] [2025-02-06 09:30:14,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:14,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-06 09:30:14,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-06 09:30:14,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:14,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:14,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377052648] [2025-02-06 09:30:14,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377052648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:14,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:14,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:30:14,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132757373] [2025-02-06 09:30:14,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:14,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:30:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:14,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:30:14,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:30:14,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-06 09:30:14,873 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-02-06 09:30:14,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:14,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-06 09:30:14,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:16,041 INFO L124 PetriNetUnfolderBase]: 603/5602 cut-off events. [2025-02-06 09:30:16,041 INFO L125 PetriNetUnfolderBase]: For 380/477 co-relation queries the response was YES. [2025-02-06 09:30:16,073 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-02-06 09:30:16,088 INFO L140 encePairwiseOnDemand]: 626/643 looper letters, 79 selfloop transitions, 19 changer transitions 0/623 dead transitions. [2025-02-06 09:30:16,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 623 transitions, 1707 flow [2025-02-06 09:30:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:30:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:30:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7121 transitions. [2025-02-06 09:30:16,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228875064800415 [2025-02-06 09:30:16,092 INFO L175 Difference]: Start difference. First operand has 590 places, 582 transitions, 1381 flow. Second operand 12 states and 7121 transitions. [2025-02-06 09:30:16,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 623 transitions, 1707 flow [2025-02-06 09:30:16,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 623 transitions, 1703 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:16,100 INFO L231 Difference]: Finished difference. Result has 603 places, 587 transitions, 1457 flow [2025-02-06 09:30:16,101 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-02-06 09:30:16,101 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 2 predicate places. [2025-02-06 09:30:16,101 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 587 transitions, 1457 flow [2025-02-06 09:30:16,102 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-02-06 09:30:16,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:16,102 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-02-06 09:30:16,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 09:30:16,103 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-02-06 09:30:16,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1341716510, now seen corresponding path program 1 times [2025-02-06 09:30:16,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662547602] [2025-02-06 09:30:16,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:16,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-06 09:30:16,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-06 09:30:16,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:16,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:30:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:16,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662547602] [2025-02-06 09:30:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662547602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:16,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:30:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207140513] [2025-02-06 09:30:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:16,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:30:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:16,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:30:16,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:30:16,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-06 09:30:16,643 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-02-06 09:30:16,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:16,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-06 09:30:16,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:17,546 INFO L124 PetriNetUnfolderBase]: 416/5737 cut-off events. [2025-02-06 09:30:17,546 INFO L125 PetriNetUnfolderBase]: For 305/328 co-relation queries the response was YES. [2025-02-06 09:30:17,605 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-02-06 09:30:17,626 INFO L140 encePairwiseOnDemand]: 626/643 looper letters, 71 selfloop transitions, 24 changer transitions 0/621 dead transitions. [2025-02-06 09:30:17,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 621 transitions, 1763 flow [2025-02-06 09:30:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 09:30:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 09:30:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7114 transitions. [2025-02-06 09:30:17,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219803006739243 [2025-02-06 09:30:17,630 INFO L175 Difference]: Start difference. First operand has 603 places, 587 transitions, 1457 flow. Second operand 12 states and 7114 transitions. [2025-02-06 09:30:17,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 621 transitions, 1763 flow [2025-02-06 09:30:17,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 621 transitions, 1746 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:30:17,641 INFO L231 Difference]: Finished difference. Result has 612 places, 596 transitions, 1573 flow [2025-02-06 09:30:17,642 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-02-06 09:30:17,642 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 11 predicate places. [2025-02-06 09:30:17,642 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 596 transitions, 1573 flow [2025-02-06 09:30:17,643 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-02-06 09:30:17,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:17,644 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-02-06 09:30:17,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 09:30:17,644 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-02-06 09:30:17,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1040408273, now seen corresponding path program 1 times [2025-02-06 09:30:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:17,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026250441] [2025-02-06 09:30:17,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:17,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-06 09:30:17,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-06 09:30:17,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:17,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:30:17,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:17,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026250441] [2025-02-06 09:30:17,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026250441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:17,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:17,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:30:17,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594222960] [2025-02-06 09:30:17,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:17,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:30:17,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:17,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:30:17,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:30:18,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-06 09:30:18,298 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-02-06 09:30:18,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:18,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-06 09:30:18,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:20,035 INFO L124 PetriNetUnfolderBase]: 940/11014 cut-off events. [2025-02-06 09:30:20,036 INFO L125 PetriNetUnfolderBase]: For 1008/1143 co-relation queries the response was YES. [2025-02-06 09:30:20,179 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-02-06 09:30:20,226 INFO L140 encePairwiseOnDemand]: 627/643 looper letters, 69 selfloop transitions, 20 changer transitions 0/624 dead transitions. [2025-02-06 09:30:20,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 624 transitions, 1853 flow [2025-02-06 09:30:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:30:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:30:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2025-02-06 09:30:20,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212498232715962 [2025-02-06 09:30:20,234 INFO L175 Difference]: Start difference. First operand has 612 places, 596 transitions, 1573 flow. Second operand 11 states and 6516 transitions. [2025-02-06 09:30:20,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 624 transitions, 1853 flow [2025-02-06 09:30:20,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 624 transitions, 1836 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:30:20,265 INFO L231 Difference]: Finished difference. Result has 621 places, 609 transitions, 1694 flow [2025-02-06 09:30:20,266 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-02-06 09:30:20,271 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 20 predicate places. [2025-02-06 09:30:20,271 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 609 transitions, 1694 flow [2025-02-06 09:30:20,273 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-02-06 09:30:20,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:20,277 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-02-06 09:30:20,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 09:30:20,277 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-02-06 09:30:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2012015751, now seen corresponding path program 1 times [2025-02-06 09:30:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769014668] [2025-02-06 09:30:20,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:20,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:20,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-06 09:30:20,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-06 09:30:20,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:20,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 09:30:20,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:20,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769014668] [2025-02-06 09:30:20,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769014668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:20,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:20,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:30:20,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543839055] [2025-02-06 09:30:20,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:20,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:30:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:20,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:30:20,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:30:20,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 643 [2025-02-06 09:30:20,840 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-02-06 09:30:20,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:20,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 643 [2025-02-06 09:30:20,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:22,073 INFO L124 PetriNetUnfolderBase]: 761/7083 cut-off events. [2025-02-06 09:30:22,073 INFO L125 PetriNetUnfolderBase]: For 1363/1483 co-relation queries the response was YES. [2025-02-06 09:30:22,150 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-02-06 09:30:22,177 INFO L140 encePairwiseOnDemand]: 627/643 looper letters, 70 selfloop transitions, 21 changer transitions 0/633 dead transitions. [2025-02-06 09:30:22,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 633 transitions, 1981 flow [2025-02-06 09:30:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:30:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:30:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6516 transitions. [2025-02-06 09:30:22,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212498232715962 [2025-02-06 09:30:22,180 INFO L175 Difference]: Start difference. First operand has 621 places, 609 transitions, 1694 flow. Second operand 11 states and 6516 transitions. [2025-02-06 09:30:22,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 633 transitions, 1981 flow [2025-02-06 09:30:22,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 633 transitions, 1977 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:22,196 INFO L231 Difference]: Finished difference. Result has 633 places, 618 transitions, 1823 flow [2025-02-06 09:30:22,196 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-02-06 09:30:22,197 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 32 predicate places. [2025-02-06 09:30:22,197 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 618 transitions, 1823 flow [2025-02-06 09:30:22,198 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-02-06 09:30:22,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:22,198 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-02-06 09:30:22,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 09:30:22,198 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-02-06 09:30:22,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1543106876, now seen corresponding path program 1 times [2025-02-06 09:30:22,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:22,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287893382] [2025-02-06 09:30:22,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:22,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:22,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-06 09:30:22,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-06 09:30:22,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:22,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:22,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:22,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287893382] [2025-02-06 09:30:22,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287893382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:22,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:22,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570901843] [2025-02-06 09:30:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:22,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:22,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:22,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:23,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-06 09:30:23,016 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-02-06 09:30:23,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:23,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-06 09:30:23,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:24,489 INFO L124 PetriNetUnfolderBase]: 682/9716 cut-off events. [2025-02-06 09:30:24,489 INFO L125 PetriNetUnfolderBase]: For 2266/2334 co-relation queries the response was YES. [2025-02-06 09:30:24,603 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-02-06 09:30:24,639 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/625 dead transitions. [2025-02-06 09:30:24,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 625 transitions, 1945 flow [2025-02-06 09:30:24,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-06 09:30:24,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-06 09:30:24,642 INFO L175 Difference]: Start difference. First operand has 633 places, 618 transitions, 1823 flow. Second operand 6 states and 3626 transitions. [2025-02-06 09:30:24,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 625 transitions, 1945 flow [2025-02-06 09:30:24,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 625 transitions, 1924 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 09:30:24,667 INFO L231 Difference]: Finished difference. Result has 630 places, 617 transitions, 1821 flow [2025-02-06 09:30:24,668 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-02-06 09:30:24,668 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 29 predicate places. [2025-02-06 09:30:24,668 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 617 transitions, 1821 flow [2025-02-06 09:30:24,669 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-02-06 09:30:24,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:24,669 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-02-06 09:30:24,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 09:30:24,669 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-02-06 09:30:24,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2059404240, now seen corresponding path program 1 times [2025-02-06 09:30:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:24,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521301] [2025-02-06 09:30:24,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:24,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-06 09:30:24,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-06 09:30:24,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:24,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:24,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521301] [2025-02-06 09:30:24,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:24,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:24,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:24,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583163975] [2025-02-06 09:30:24,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:24,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:24,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:24,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:25,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-06 09:30:25,428 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-02-06 09:30:25,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:25,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-06 09:30:25,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:27,119 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-02-06 09:30:27,119 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-02-06 09:30:27,119 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-02-06 09:30:27,119 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-02-06 09:30:27,119 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-02-06 09:30:27,133 INFO L124 PetriNetUnfolderBase]: 734/10389 cut-off events. [2025-02-06 09:30:27,133 INFO L125 PetriNetUnfolderBase]: For 2603/2778 co-relation queries the response was YES. [2025-02-06 09:30:27,270 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-02-06 09:30:27,308 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/624 dead transitions. [2025-02-06 09:30:27,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 624 transitions, 1943 flow [2025-02-06 09:30:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-06 09:30:27,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-06 09:30:27,310 INFO L175 Difference]: Start difference. First operand has 630 places, 617 transitions, 1821 flow. Second operand 6 states and 3626 transitions. [2025-02-06 09:30:27,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 624 transitions, 1943 flow [2025-02-06 09:30:27,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 624 transitions, 1930 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 09:30:27,341 INFO L231 Difference]: Finished difference. Result has 630 places, 616 transitions, 1827 flow [2025-02-06 09:30:27,341 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-02-06 09:30:27,342 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 29 predicate places. [2025-02-06 09:30:27,342 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 616 transitions, 1827 flow [2025-02-06 09:30:27,342 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-02-06 09:30:27,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:27,342 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-02-06 09:30:27,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 09:30:27,343 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-02-06 09:30:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:27,343 INFO L85 PathProgramCache]: Analyzing trace with hash -892402991, now seen corresponding path program 1 times [2025-02-06 09:30:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334061270] [2025-02-06 09:30:27,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:27,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 09:30:27,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 09:30:27,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:27,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:27,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:27,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334061270] [2025-02-06 09:30:27,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334061270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:27,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:27,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:27,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370555159] [2025-02-06 09:30:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:27,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:27,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:27,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:27,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:27,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 643 [2025-02-06 09:30:27,411 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-02-06 09:30:27,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:27,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 643 [2025-02-06 09:30:27,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:29,109 INFO L124 PetriNetUnfolderBase]: 774/9776 cut-off events. [2025-02-06 09:30:29,109 INFO L125 PetriNetUnfolderBase]: For 1640/1665 co-relation queries the response was YES. [2025-02-06 09:30:29,158 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-02-06 09:30:29,177 INFO L140 encePairwiseOnDemand]: 637/643 looper letters, 19 selfloop transitions, 2 changer transitions 0/618 dead transitions. [2025-02-06 09:30:29,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 618 transitions, 1877 flow [2025-02-06 09:30:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1864 transitions. [2025-02-06 09:30:29,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9663037843442198 [2025-02-06 09:30:29,179 INFO L175 Difference]: Start difference. First operand has 630 places, 616 transitions, 1827 flow. Second operand 3 states and 1864 transitions. [2025-02-06 09:30:29,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 618 transitions, 1877 flow [2025-02-06 09:30:29,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 618 transitions, 1864 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 09:30:29,193 INFO L231 Difference]: Finished difference. Result has 625 places, 614 transitions, 1820 flow [2025-02-06 09:30:29,194 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-02-06 09:30:29,194 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 24 predicate places. [2025-02-06 09:30:29,194 INFO L471 AbstractCegarLoop]: Abstraction has has 625 places, 614 transitions, 1820 flow [2025-02-06 09:30:29,195 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-02-06 09:30:29,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:29,195 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-02-06 09:30:29,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 09:30:29,195 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-02-06 09:30:29,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1761953504, now seen corresponding path program 1 times [2025-02-06 09:30:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:29,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097056433] [2025-02-06 09:30:29,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:29,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-06 09:30:29,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-06 09:30:29,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:29,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:30:29,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:29,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097056433] [2025-02-06 09:30:29,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097056433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:29,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:29,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953499040] [2025-02-06 09:30:29,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:29,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:29,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:29,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:29,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:29,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-06 09:30:29,946 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-02-06 09:30:29,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:29,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-06 09:30:29,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:31,696 INFO L124 PetriNetUnfolderBase]: 747/10933 cut-off events. [2025-02-06 09:30:31,697 INFO L125 PetriNetUnfolderBase]: For 2479/2551 co-relation queries the response was YES. [2025-02-06 09:30:31,801 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-02-06 09:30:31,833 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/620 dead transitions. [2025-02-06 09:30:31,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 620 transitions, 1936 flow [2025-02-06 09:30:31,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-06 09:30:31,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-06 09:30:31,839 INFO L175 Difference]: Start difference. First operand has 625 places, 614 transitions, 1820 flow. Second operand 6 states and 3626 transitions. [2025-02-06 09:30:31,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 620 transitions, 1936 flow [2025-02-06 09:30:31,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 620 transitions, 1936 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:31,882 INFO L231 Difference]: Finished difference. Result has 628 places, 612 transitions, 1828 flow [2025-02-06 09:30:31,882 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-02-06 09:30:31,883 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 27 predicate places. [2025-02-06 09:30:31,883 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 612 transitions, 1828 flow [2025-02-06 09:30:31,884 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-02-06 09:30:31,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:31,884 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-02-06 09:30:31,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 09:30:31,884 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-02-06 09:30:31,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:31,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1785724892, now seen corresponding path program 1 times [2025-02-06 09:30:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:31,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398611083] [2025-02-06 09:30:31,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:31,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:31,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-06 09:30:31,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-06 09:30:31,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:31,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398611083] [2025-02-06 09:30:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398611083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:32,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:32,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353284363] [2025-02-06 09:30:32,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:32,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:32,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:32,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:32,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-06 09:30:32,633 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-02-06 09:30:32,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:32,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-06 09:30:32,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:33,819 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-02-06 09:30:33,819 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-02-06 09:30:33,819 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-06 09:30:33,819 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-02-06 09:30:33,819 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2025-02-06 09:30:33,823 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-02-06 09:30:33,823 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-02-06 09:30:33,823 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-06 09:30:33,823 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-06 09:30:33,823 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-06 09:30:33,827 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-02-06 09:30:33,827 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-02-06 09:30:33,827 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-06 09:30:33,827 INFO L297 olderBase$Statistics]: existing Event has 328 ancestors and is cut-off event [2025-02-06 09:30:33,827 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-06 09:30:33,831 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-02-06 09:30:33,831 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2025-02-06 09:30:33,831 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-02-06 09:30:33,831 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-02-06 09:30:33,831 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2025-02-06 09:30:33,834 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-02-06 09:30:33,835 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2025-02-06 09:30:33,835 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-06 09:30:33,835 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-06 09:30:33,835 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2025-02-06 09:30:33,856 INFO L124 PetriNetUnfolderBase]: 711/7183 cut-off events. [2025-02-06 09:30:33,857 INFO L125 PetriNetUnfolderBase]: For 2331/2555 co-relation queries the response was YES. [2025-02-06 09:30:33,939 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-02-06 09:30:33,965 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/619 dead transitions. [2025-02-06 09:30:33,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 619 transitions, 1950 flow [2025-02-06 09:30:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-06 09:30:33,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-06 09:30:33,967 INFO L175 Difference]: Start difference. First operand has 628 places, 612 transitions, 1828 flow. Second operand 6 states and 3626 transitions. [2025-02-06 09:30:33,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 619 transitions, 1950 flow [2025-02-06 09:30:33,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 619 transitions, 1938 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:30:33,983 INFO L231 Difference]: Finished difference. Result has 627 places, 611 transitions, 1835 flow [2025-02-06 09:30:33,984 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-02-06 09:30:33,984 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 26 predicate places. [2025-02-06 09:30:33,984 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 611 transitions, 1835 flow [2025-02-06 09:30:33,985 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-02-06 09:30:33,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:33,985 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-02-06 09:30:33,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 09:30:33,985 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-02-06 09:30:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:33,986 INFO L85 PathProgramCache]: Analyzing trace with hash 308609076, now seen corresponding path program 1 times [2025-02-06 09:30:33,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:33,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201977306] [2025-02-06 09:30:33,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:33,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:34,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-06 09:30:34,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-06 09:30:34,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:34,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:30:34,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:34,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201977306] [2025-02-06 09:30:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201977306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:34,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:34,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133161306] [2025-02-06 09:30:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:34,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:34,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:34,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:34,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-06 09:30:34,825 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-02-06 09:30:34,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:34,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-06 09:30:34,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:36,727 INFO L124 PetriNetUnfolderBase]: 778/10893 cut-off events. [2025-02-06 09:30:36,727 INFO L125 PetriNetUnfolderBase]: For 2961/3141 co-relation queries the response was YES. [2025-02-06 09:30:36,792 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-02-06 09:30:36,817 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/617 dead transitions. [2025-02-06 09:30:36,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 617 transitions, 1951 flow [2025-02-06 09:30:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-06 09:30:36,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-06 09:30:36,820 INFO L175 Difference]: Start difference. First operand has 627 places, 611 transitions, 1835 flow. Second operand 6 states and 3626 transitions. [2025-02-06 09:30:36,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 617 transitions, 1951 flow [2025-02-06 09:30:36,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 617 transitions, 1938 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 09:30:36,847 INFO L231 Difference]: Finished difference. Result has 626 places, 609 transitions, 1830 flow [2025-02-06 09:30:36,847 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-02-06 09:30:36,848 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 25 predicate places. [2025-02-06 09:30:36,848 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 609 transitions, 1830 flow [2025-02-06 09:30:36,848 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-02-06 09:30:36,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:36,848 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-02-06 09:30:36,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 09:30:36,849 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-02-06 09:30:36,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash 169648501, now seen corresponding path program 1 times [2025-02-06 09:30:36,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:36,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086159604] [2025-02-06 09:30:36,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:36,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:36,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-06 09:30:36,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-06 09:30:36,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:36,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086159604] [2025-02-06 09:30:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086159604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:36,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576435378] [2025-02-06 09:30:36,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:36,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:36,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:36,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:36,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 643 [2025-02-06 09:30:36,893 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-02-06 09:30:36,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:36,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 643 [2025-02-06 09:30:36,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:38,708 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-02-06 09:30:38,709 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-06 09:30:38,709 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-06 09:30:38,709 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-06 09:30:38,709 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-06 09:30:38,729 INFO L124 PetriNetUnfolderBase]: 683/10524 cut-off events. [2025-02-06 09:30:38,730 INFO L125 PetriNetUnfolderBase]: For 2284/2319 co-relation queries the response was YES. [2025-02-06 09:30:38,795 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-02-06 09:30:38,814 INFO L140 encePairwiseOnDemand]: 641/643 looper letters, 10 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2025-02-06 09:30:38,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 608 transitions, 1850 flow [2025-02-06 09:30:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-06 09:30:38,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-06 09:30:38,815 INFO L175 Difference]: Start difference. First operand has 626 places, 609 transitions, 1830 flow. Second operand 3 states and 1872 transitions. [2025-02-06 09:30:38,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 608 transitions, 1850 flow [2025-02-06 09:30:38,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 608 transitions, 1838 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:30:38,837 INFO L231 Difference]: Finished difference. Result has 622 places, 608 transitions, 1818 flow [2025-02-06 09:30:38,841 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-02-06 09:30:38,841 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 21 predicate places. [2025-02-06 09:30:38,841 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 608 transitions, 1818 flow [2025-02-06 09:30:38,842 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-02-06 09:30:38,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:38,842 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-02-06 09:30:38,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-06 09:30:38,842 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-02-06 09:30:38,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash 785660096, now seen corresponding path program 1 times [2025-02-06 09:30:38,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:38,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325054390] [2025-02-06 09:30:38,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:38,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:38,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-06 09:30:38,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-06 09:30:38,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:38,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:39,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325054390] [2025-02-06 09:30:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325054390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:39,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:30:39,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652940243] [2025-02-06 09:30:39,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:39,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:30:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:39,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:30:39,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:30:39,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 643 [2025-02-06 09:30:39,553 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-02-06 09:30:39,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:39,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 643 [2025-02-06 09:30:39,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:40,614 INFO L124 PetriNetUnfolderBase]: 636/6942 cut-off events. [2025-02-06 09:30:40,614 INFO L125 PetriNetUnfolderBase]: For 2396/2596 co-relation queries the response was YES. [2025-02-06 09:30:40,688 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-02-06 09:30:40,707 INFO L140 encePairwiseOnDemand]: 635/643 looper letters, 42 selfloop transitions, 6 changer transitions 0/614 dead transitions. [2025-02-06 09:30:40,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 614 transitions, 1934 flow [2025-02-06 09:30:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:30:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:30:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3626 transitions. [2025-02-06 09:30:40,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398652151373769 [2025-02-06 09:30:40,709 INFO L175 Difference]: Start difference. First operand has 622 places, 608 transitions, 1818 flow. Second operand 6 states and 3626 transitions. [2025-02-06 09:30:40,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 614 transitions, 1934 flow [2025-02-06 09:30:40,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 614 transitions, 1933 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:40,725 INFO L231 Difference]: Finished difference. Result has 624 places, 606 transitions, 1825 flow [2025-02-06 09:30:40,726 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-02-06 09:30:40,726 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 23 predicate places. [2025-02-06 09:30:40,726 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 606 transitions, 1825 flow [2025-02-06 09:30:40,727 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-02-06 09:30:40,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:40,728 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-02-06 09:30:40,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-06 09:30:40,728 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-02-06 09:30:40,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash -889651652, now seen corresponding path program 1 times [2025-02-06 09:30:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:40,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960362541] [2025-02-06 09:30:40,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:40,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-06 09:30:40,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-06 09:30:40,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:40,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:40,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960362541] [2025-02-06 09:30:40,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960362541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:40,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344106878] [2025-02-06 09:30:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:40,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:40,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:40,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:40,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 643 [2025-02-06 09:30:40,774 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-02-06 09:30:40,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:40,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 643 [2025-02-06 09:30:40,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:42,453 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-02-06 09:30:42,453 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-06 09:30:42,453 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-06 09:30:42,453 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-06 09:30:42,453 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-06 09:30:42,466 INFO L124 PetriNetUnfolderBase]: 688/10505 cut-off events. [2025-02-06 09:30:42,467 INFO L125 PetriNetUnfolderBase]: For 2436/2506 co-relation queries the response was YES. [2025-02-06 09:30:42,613 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-02-06 09:30:42,649 INFO L140 encePairwiseOnDemand]: 641/643 looper letters, 10 selfloop transitions, 1 changer transitions 0/605 dead transitions. [2025-02-06 09:30:42,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 605 transitions, 1845 flow [2025-02-06 09:30:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1872 transitions. [2025-02-06 09:30:42,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704510108864697 [2025-02-06 09:30:42,650 INFO L175 Difference]: Start difference. First operand has 624 places, 606 transitions, 1825 flow. Second operand 3 states and 1872 transitions. [2025-02-06 09:30:42,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 605 transitions, 1845 flow [2025-02-06 09:30:42,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 605 transitions, 1833 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:30:42,681 INFO L231 Difference]: Finished difference. Result has 620 places, 605 transitions, 1813 flow [2025-02-06 09:30:42,681 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-02-06 09:30:42,681 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 19 predicate places. [2025-02-06 09:30:42,681 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 605 transitions, 1813 flow [2025-02-06 09:30:42,682 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-02-06 09:30:42,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:42,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:30:42,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-06 09:30:42,682 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-02-06 09:30:42,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash -883461164, now seen corresponding path program 1 times [2025-02-06 09:30:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:42,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098403191] [2025-02-06 09:30:42,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:42,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-06 09:30:42,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-06 09:30:42,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:42,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:42,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:42,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098403191] [2025-02-06 09:30:42,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098403191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:42,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:42,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:30:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477621872] [2025-02-06 09:30:42,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:42,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:30:42,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:42,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:30:42,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:30:42,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 614 out of 643 [2025-02-06 09:30:42,739 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-02-06 09:30:42,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:42,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 614 of 643 [2025-02-06 09:30:42,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:43,689 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-02-06 09:30:43,689 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-06 09:30:43,689 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-06 09:30:43,689 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-06 09:30:43,689 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-06 09:30:43,693 INFO L124 PetriNetUnfolderBase]: 345/5842 cut-off events. [2025-02-06 09:30:43,693 INFO L125 PetriNetUnfolderBase]: For 1203/1238 co-relation queries the response was YES. [2025-02-06 09:30:43,763 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-02-06 09:30:43,780 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 12 selfloop transitions, 0 changer transitions 2/606 dead transitions. [2025-02-06 09:30:43,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 606 transitions, 1843 flow [2025-02-06 09:30:43,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:30:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 09:30:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2471 transitions. [2025-02-06 09:30:43,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607309486780715 [2025-02-06 09:30:43,782 INFO L175 Difference]: Start difference. First operand has 620 places, 605 transitions, 1813 flow. Second operand 4 states and 2471 transitions. [2025-02-06 09:30:43,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 606 transitions, 1843 flow [2025-02-06 09:30:43,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 606 transitions, 1842 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:43,796 INFO L231 Difference]: Finished difference. Result has 624 places, 604 transitions, 1814 flow [2025-02-06 09:30:43,797 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-02-06 09:30:43,800 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 23 predicate places. [2025-02-06 09:30:43,801 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 604 transitions, 1814 flow [2025-02-06 09:30:43,801 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-02-06 09:30:43,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:43,801 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-02-06 09:30:43,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-06 09:30:43,801 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-02-06 09:30:43,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1171118257, now seen corresponding path program 1 times [2025-02-06 09:30:43,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:43,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617073083] [2025-02-06 09:30:43,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:43,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:43,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-06 09:30:43,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-06 09:30:43,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:43,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:43,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-02-06 09:30:43,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:43,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617073083] [2025-02-06 09:30:43,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617073083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:43,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:43,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:43,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87747917] [2025-02-06 09:30:43,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:43,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:43,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:43,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:43,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:43,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 643 [2025-02-06 09:30:43,843 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-02-06 09:30:43,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:43,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 643 [2025-02-06 09:30:43,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:44,772 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-02-06 09:30:44,772 INFO L294 olderBase$Statistics]: this new event has 390 ancestors and is cut-off event [2025-02-06 09:30:44,772 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-06 09:30:44,772 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-06 09:30:44,772 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-06 09:30:44,792 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-02-06 09:30:44,792 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-02-06 09:30:44,793 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-02-06 09:30:44,793 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is cut-off event [2025-02-06 09:30:44,793 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-02-06 09:30:44,793 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-02-06 09:30:44,794 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is not cut-off event [2025-02-06 09:30:44,794 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-06 09:30:44,794 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-06 09:30:44,794 INFO L297 olderBase$Statistics]: existing Event has 386 ancestors and is not cut-off event [2025-02-06 09:30:44,794 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is not cut-off event [2025-02-06 09:30:44,798 INFO L124 PetriNetUnfolderBase]: 464/6048 cut-off events. [2025-02-06 09:30:44,798 INFO L125 PetriNetUnfolderBase]: For 1278/1329 co-relation queries the response was YES. [2025-02-06 09:30:44,867 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-02-06 09:30:44,883 INFO L140 encePairwiseOnDemand]: 641/643 looper letters, 8 selfloop transitions, 0 changer transitions 21/603 dead transitions. [2025-02-06 09:30:44,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 603 transitions, 1832 flow [2025-02-06 09:30:44,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2025-02-06 09:30:44,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9699326075686885 [2025-02-06 09:30:44,884 INFO L175 Difference]: Start difference. First operand has 624 places, 604 transitions, 1814 flow. Second operand 3 states and 1871 transitions. [2025-02-06 09:30:44,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 603 transitions, 1832 flow [2025-02-06 09:30:44,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 603 transitions, 1828 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:44,903 INFO L231 Difference]: Finished difference. Result has 621 places, 582 transitions, 1677 flow [2025-02-06 09:30:44,908 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-02-06 09:30:44,908 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 20 predicate places. [2025-02-06 09:30:44,908 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 582 transitions, 1677 flow [2025-02-06 09:30:44,909 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-02-06 09:30:44,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:44,909 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-02-06 09:30:44,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-06 09:30:44,909 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-02-06 09:30:44,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash 542561599, now seen corresponding path program 1 times [2025-02-06 09:30:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:44,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133730227] [2025-02-06 09:30:44,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:44,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:44,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-06 09:30:44,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-06 09:30:44,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:44,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:30:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:44,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133730227] [2025-02-06 09:30:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133730227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:44,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:44,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605605123] [2025-02-06 09:30:44,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:44,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:44,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:44,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:45,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:45,009 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-02-06 09:30:45,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:45,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:45,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:46,594 INFO L124 PetriNetUnfolderBase]: 625/9646 cut-off events. [2025-02-06 09:30:46,594 INFO L125 PetriNetUnfolderBase]: For 1707/1733 co-relation queries the response was YES. [2025-02-06 09:30:46,727 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-02-06 09:30:46,755 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 11 selfloop transitions, 2 changer transitions 14/583 dead transitions. [2025-02-06 09:30:46,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 583 transitions, 1707 flow [2025-02-06 09:30:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2025-02-06 09:30:46,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683773976153447 [2025-02-06 09:30:46,758 INFO L175 Difference]: Start difference. First operand has 621 places, 582 transitions, 1677 flow. Second operand 3 states and 1868 transitions. [2025-02-06 09:30:46,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 583 transitions, 1707 flow [2025-02-06 09:30:46,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 583 transitions, 1693 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-02-06 09:30:46,782 INFO L231 Difference]: Finished difference. Result has 608 places, 567 transitions, 1561 flow [2025-02-06 09:30:46,783 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-02-06 09:30:46,785 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, 7 predicate places. [2025-02-06 09:30:46,785 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 567 transitions, 1561 flow [2025-02-06 09:30:46,785 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-02-06 09:30:46,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:46,786 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-02-06 09:30:46,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-06 09:30:46,786 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-02-06 09:30:46,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 958161084, now seen corresponding path program 1 times [2025-02-06 09:30:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:46,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606352700] [2025-02-06 09:30:46,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:46,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-06 09:30:46,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-06 09:30:46,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:46,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 09:30:46,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:46,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606352700] [2025-02-06 09:30:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606352700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:46,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:46,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718995609] [2025-02-06 09:30:46,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:46,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:46,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:46,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:46,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:46,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:46,896 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-02-06 09:30:46,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:46,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:46,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:48,130 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-02-06 09:30:48,131 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2025-02-06 09:30:48,131 INFO L297 olderBase$Statistics]: existing Event has 324 ancestors and is cut-off event [2025-02-06 09:30:48,131 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-02-06 09:30:48,131 INFO L297 olderBase$Statistics]: existing Event has 355 ancestors and is cut-off event [2025-02-06 09:30:48,210 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-02-06 09:30:48,210 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-02-06 09:30:48,210 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-06 09:30:48,210 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-06 09:30:48,210 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-06 09:30:48,226 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-02-06 09:30:48,227 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2025-02-06 09:30:48,227 INFO L297 olderBase$Statistics]: existing Event has 385 ancestors and is cut-off event [2025-02-06 09:30:48,227 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-02-06 09:30:48,227 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-02-06 09:30:48,228 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-02-06 09:30:48,228 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2025-02-06 09:30:48,228 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-06 09:30:48,228 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-02-06 09:30:48,228 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-06 09:30:48,228 INFO L124 PetriNetUnfolderBase]: 536/7958 cut-off events. [2025-02-06 09:30:48,228 INFO L125 PetriNetUnfolderBase]: For 1220/1260 co-relation queries the response was YES. [2025-02-06 09:30:48,338 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-02-06 09:30:48,363 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 11 selfloop transitions, 2 changer transitions 13/568 dead transitions. [2025-02-06 09:30:48,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 568 transitions, 1591 flow [2025-02-06 09:30:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2025-02-06 09:30:48,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683773976153447 [2025-02-06 09:30:48,365 INFO L175 Difference]: Start difference. First operand has 608 places, 567 transitions, 1561 flow. Second operand 3 states and 1868 transitions. [2025-02-06 09:30:48,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 568 transitions, 1591 flow [2025-02-06 09:30:48,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 568 transitions, 1539 flow, removed 16 selfloop flow, removed 13 redundant places. [2025-02-06 09:30:48,390 INFO L231 Difference]: Finished difference. Result has 589 places, 553 transitions, 1426 flow [2025-02-06 09:30:48,390 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-02-06 09:30:48,391 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -12 predicate places. [2025-02-06 09:30:48,391 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 553 transitions, 1426 flow [2025-02-06 09:30:48,391 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-02-06 09:30:48,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:48,392 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-02-06 09:30:48,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-06 09:30:48,392 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-02-06 09:30:48,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1687737281, now seen corresponding path program 1 times [2025-02-06 09:30:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:48,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029776708] [2025-02-06 09:30:48,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:48,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 09:30:48,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 09:30:48,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:48,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:30:48,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:48,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029776708] [2025-02-06 09:30:48,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029776708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:48,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:48,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:48,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032692438] [2025-02-06 09:30:48,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:48,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:48,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:48,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:48,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:48,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 643 [2025-02-06 09:30:48,451 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-02-06 09:30:48,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:48,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 643 [2025-02-06 09:30:48,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:48,952 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-02-06 09:30:48,952 INFO L294 olderBase$Statistics]: this new event has 358 ancestors and is cut-off event [2025-02-06 09:30:48,952 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-06 09:30:48,952 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-06 09:30:48,952 INFO L297 olderBase$Statistics]: existing Event has 327 ancestors and is cut-off event [2025-02-06 09:30:48,969 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-02-06 09:30:48,969 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2025-02-06 09:30:48,969 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-02-06 09:30:48,969 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-06 09:30:48,969 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-02-06 09:30:48,969 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-02-06 09:30:48,970 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2025-02-06 09:30:48,970 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-06 09:30:48,970 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-06 09:30:48,970 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-06 09:30:48,970 INFO L124 PetriNetUnfolderBase]: 300/3535 cut-off events. [2025-02-06 09:30:48,970 INFO L125 PetriNetUnfolderBase]: For 310/352 co-relation queries the response was YES. [2025-02-06 09:30:49,009 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-02-06 09:30:49,011 INFO L140 encePairwiseOnDemand]: 640/643 looper letters, 0 selfloop transitions, 0 changer transitions 554/554 dead transitions. [2025-02-06 09:30:49,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 554 transitions, 1456 flow [2025-02-06 09:30:49,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2025-02-06 09:30:49,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9683773976153447 [2025-02-06 09:30:49,013 INFO L175 Difference]: Start difference. First operand has 589 places, 553 transitions, 1426 flow. Second operand 3 states and 1868 transitions. [2025-02-06 09:30:49,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 554 transitions, 1456 flow [2025-02-06 09:30:49,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 554 transitions, 1402 flow, removed 12 selfloop flow, removed 15 redundant places. [2025-02-06 09:30:49,020 INFO L231 Difference]: Finished difference. Result has 568 places, 0 transitions, 0 flow [2025-02-06 09:30:49,020 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-02-06 09:30:49,020 INFO L279 CegarLoopForPetriNet]: 601 programPoint places, -33 predicate places. [2025-02-06 09:30:49,020 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 0 transitions, 0 flow [2025-02-06 09:30:49,021 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-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (134 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (132 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (131 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (130 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (128 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (127 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (126 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (125 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (124 of 135 remaining) [2025-02-06 09:30:49,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (123 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (122 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (121 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (120 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (119 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (118 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (117 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (116 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (115 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (113 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (112 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (111 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (110 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (109 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (108 of 135 remaining) [2025-02-06 09:30:49,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (107 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (106 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (105 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (104 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (103 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (101 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (98 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (97 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (96 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (95 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (93 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (92 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (91 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (90 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (89 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (88 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (87 of 135 remaining) [2025-02-06 09:30:49,025 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (85 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (84 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (83 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (82 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (81 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (80 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (79 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (77 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (75 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (73 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (72 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (71 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (70 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (69 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (68 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (66 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (64 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (63 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (62 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (61 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (60 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (56 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (55 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (53 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (52 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (50 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (48 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (47 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (46 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (45 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (44 of 135 remaining) [2025-02-06 09:30:49,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (43 of 135 remaining) [2025-02-06 09:30:49,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 135 remaining) [2025-02-06 09:30:49,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 135 remaining) [2025-02-06 09:30:49,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (40 of 135 remaining) [2025-02-06 09:30:49,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 135 remaining) [2025-02-06 09:30:49,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 135 remaining) [2025-02-06 09:30:49,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (37 of 135 remaining) [2025-02-06 09:30:49,027 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (36 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (34 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (32 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (28 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (26 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 135 remaining) [2025-02-06 09:30:49,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (15 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (14 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (10 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (9 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 135 remaining) [2025-02-06 09:30:49,029 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 135 remaining) [2025-02-06 09:30:49,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-06 09:30:49,029 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-02-06 09:30:49,033 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:30:49,033 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:30:49,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:30:49 BasicIcfg [2025-02-06 09:30:49,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:30:49,037 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:30:49,037 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:30:49,038 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:30:49,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:50" (3/4) ... [2025-02-06 09:30:49,039 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:30:49,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:30:49,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:30:49,041 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:30:49,045 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-06 09:30:49,046 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:30:49,046 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:30:49,046 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:30:49,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:30:49,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:30:49,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:30:49,107 INFO L158 Benchmark]: Toolchain (without parser) took 60003.27ms. Allocated memory was 142.6MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 107.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2025-02-06 09:30:49,107 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:30:49,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.15ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.6MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:30:49,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.10ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:30:49,107 INFO L158 Benchmark]: Boogie Preprocessor took 40.02ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:30:49,108 INFO L158 Benchmark]: IcfgBuilder took 1027.89ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 43.4MB in the end (delta: 45.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 09:30:49,108 INFO L158 Benchmark]: TraceAbstraction took 58595.29ms. Allocated memory was 142.6MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 42.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2025-02-06 09:30:49,108 INFO L158 Benchmark]: Witness Printer took 68.80ms. Allocated memory is still 5.3GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:30:49,109 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.19ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.15ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.6MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.10ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 90.5MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.02ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 88.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1027.89ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 43.4MB in the end (delta: 45.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 58595.29ms. Allocated memory was 142.6MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 42.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. * Witness Printer took 68.80ms. Allocated memory is still 5.3GB. Free memory was 1.7GB in the beginning and 1.7GB 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, 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: 58.3s, OverallIterations: 47, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 52.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6984 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4394 mSDsluCounter, 6917 SdHoareTripleChecker+Invalid, 5.8s 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.1s 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-02-06 09:30:49,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE