./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i --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/goblint-regression/06-symbeq_04-funloop_hard1.i -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 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:20:45,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:20:45,994 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:20:46,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:20:46,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:20:46,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:20:46,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:20:46,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:20:46,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:20:46,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:20:46,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:20:46,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:20:46,031 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:20:46,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:20:46,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:20:46,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:20:46,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:20:46,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:20:46,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:20:46,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:20:46,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:20:46,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:20:46,032 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:20:46,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:20:46,033 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:20:46,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:20:46,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:20:46,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:20:46,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:20:46,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:20:46,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:20:46,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:46,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:20:46,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:20:46,034 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:20:46,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:20:46,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:20:46,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:20:46,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:20:46,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:20:46,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:20:46,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:20:46,035 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 -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2025-02-06 09:20:46,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:20:46,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:20:46,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:20:46,316 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:20:46,316 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:20:46,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2025-02-06 09:20:47,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/802e1a1b5/de86d2f93835496eb81dc81b73200cc9/FLAG093a769b9 [2025-02-06 09:20:47,891 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:20:47,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2025-02-06 09:20:47,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/802e1a1b5/de86d2f93835496eb81dc81b73200cc9/FLAG093a769b9 [2025-02-06 09:20:47,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/802e1a1b5/de86d2f93835496eb81dc81b73200cc9 [2025-02-06 09:20:47,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:20:47,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:20:47,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:47,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:20:47,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:20:47,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:47" (1/1) ... [2025-02-06 09:20:47,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@589f9d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:47, skipping insertion in model container [2025-02-06 09:20:47,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:47" (1/1) ... [2025-02-06 09:20:47,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:20:48,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:48,434 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:20:48,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:48,562 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:20:48,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48 WrapperNode [2025-02-06 09:20:48,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:48,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:48,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:20:48,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:20:48,570 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:20:48" (1/1) ... [2025-02-06 09:20:48,589 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:20:48" (1/1) ... [2025-02-06 09:20:48,623 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2025-02-06 09:20:48,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:48,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:20:48,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:20:48,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:20:48,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (1/1) ... [2025-02-06 09:20:48,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (1/1) ... [2025-02-06 09:20:48,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (1/1) ... [2025-02-06 09:20:48,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (1/1) ... [2025-02-06 09:20:48,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (1/1) ... [2025-02-06 09:20:48,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (1/1) ... [2025-02-06 09:20:48,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (1/1) ... [2025-02-06 09:20:48,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (1/1) ... [2025-02-06 09:20:48,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:20:48,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:20:48,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:20:48,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:20:48,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (1/1) ... [2025-02-06 09:20:48,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:48,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:48,710 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:20:48,713 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:20:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:20:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:20:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:20:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:20:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:20:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:20:48,736 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:20:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:20:48,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:20:48,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:20:48,738 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:20:48,873 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:20:48,875 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:20:49,249 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:20:49,250 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:20:49,278 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:20:49,279 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:20:49,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:49 BoogieIcfgContainer [2025-02-06 09:20:49,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:20:49,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:20:49,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:20:49,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:20:49,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:20:47" (1/3) ... [2025-02-06 09:20:49,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54805146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:49, skipping insertion in model container [2025-02-06 09:20:49,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:48" (2/3) ... [2025-02-06 09:20:49,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54805146 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:49, skipping insertion in model container [2025-02-06 09:20:49,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:49" (3/3) ... [2025-02-06 09:20:49,291 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2025-02-06 09:20:49,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:20:49,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_04-funloop_hard1.i that has 2 procedures, 180 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-06 09:20:49,308 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:20:49,397 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:20:49,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 182 transitions, 368 flow [2025-02-06 09:20:49,546 INFO L124 PetriNetUnfolderBase]: 3/181 cut-off events. [2025-02-06 09:20:49,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:20:49,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 181 events. 3/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 232 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2025-02-06 09:20:49,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 182 transitions, 368 flow [2025-02-06 09:20:49,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 181 transitions, 365 flow [2025-02-06 09:20:49,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:20:49,592 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;@250d4d0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:20:49,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 09:20:49,616 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:20:49,616 INFO L124 PetriNetUnfolderBase]: 1/115 cut-off events. [2025-02-06 09:20:49,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:20:49,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:49,618 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] [2025-02-06 09:20:49,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 398662977, now seen corresponding path program 1 times [2025-02-06 09:20:49,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:49,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110490966] [2025-02-06 09:20:49,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:49,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:49,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 09:20:49,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 09:20:49,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:49,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:50,020 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:20:50,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110490966] [2025-02-06 09:20:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110490966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:20:50,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392333237] [2025-02-06 09:20:50,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:50,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:20:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:50,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:20:50,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:20:50,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-02-06 09:20:50,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 181 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:20:50,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:50,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-02-06 09:20:50,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:50,203 INFO L124 PetriNetUnfolderBase]: 15/321 cut-off events. [2025-02-06 09:20:50,204 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:20:50,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 321 events. 15/321 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 914 event pairs, 10 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 266. Up to 36 conditions per place. [2025-02-06 09:20:50,210 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 12 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-02-06 09:20:50,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 395 flow [2025-02-06 09:20:50,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:20:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:20:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-02-06 09:20:50,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560439560439561 [2025-02-06 09:20:50,227 INFO L175 Difference]: Start difference. First operand has 182 places, 181 transitions, 365 flow. Second operand 3 states and 522 transitions. [2025-02-06 09:20:50,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 395 flow [2025-02-06 09:20:50,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:20:50,239 INFO L231 Difference]: Finished difference. Result has 184 places, 182 transitions, 376 flow [2025-02-06 09:20:50,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=184, PETRI_TRANSITIONS=182} [2025-02-06 09:20:50,244 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 2 predicate places. [2025-02-06 09:20:50,245 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 376 flow [2025-02-06 09:20:50,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:20:50,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:50,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:20:50,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:20:50,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:50,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash 273525691, now seen corresponding path program 1 times [2025-02-06 09:20:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120181306] [2025-02-06 09:20:50,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:50,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:20:50,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:20:50,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:50,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:50,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120181306] [2025-02-06 09:20:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120181306] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:20:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584708218] [2025-02-06 09:20:50,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:50,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:50,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:50,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:20:50,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:20:50,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 09:20:50,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 09:20:50,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:50,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:50,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 09:20:50,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:20:50,690 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:20:50,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:20:50,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584708218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:50,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:20:50,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-06 09:20:50,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608687700] [2025-02-06 09:20:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:50,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:20:50,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:50,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:20:50,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:50,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-02-06 09:20:50,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 182 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:20:50,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:50,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-02-06 09:20:50,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:50,814 INFO L124 PetriNetUnfolderBase]: 35/481 cut-off events. [2025-02-06 09:20:50,814 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:20:50,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 481 events. 35/481 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1726 event pairs, 10 based on Foata normal form. 3/450 useless extension candidates. Maximal degree in co-relation 481. Up to 51 conditions per place. [2025-02-06 09:20:50,821 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-02-06 09:20:50,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 187 transitions, 422 flow [2025-02-06 09:20:50,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:20:50,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:20:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-02-06 09:20:50,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633699633699634 [2025-02-06 09:20:50,827 INFO L175 Difference]: Start difference. First operand has 184 places, 182 transitions, 376 flow. Second operand 3 states and 526 transitions. [2025-02-06 09:20:50,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 187 transitions, 422 flow [2025-02-06 09:20:50,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 187 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:20:50,850 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 386 flow [2025-02-06 09:20:50,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-02-06 09:20:50,853 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-02-06 09:20:50,853 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 386 flow [2025-02-06 09:20:50,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:20:50,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:50,854 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] [2025-02-06 09:20:50,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:20:51,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:51,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:51,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2132139115, now seen corresponding path program 1 times [2025-02-06 09:20:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851584050] [2025-02-06 09:20:51,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:51,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 09:20:51,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 09:20:51,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:51,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:51,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:51,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:51,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851584050] [2025-02-06 09:20:51,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851584050] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:20:51,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547939254] [2025-02-06 09:20:51,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:51,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:51,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:51,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:20:51,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:20:51,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 09:20:51,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 09:20:51,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:51,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:51,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:20:51,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:20:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:51,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:20:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:51,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547939254] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:20:51,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:20:51,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:20:51,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032124422] [2025-02-06 09:20:51,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:20:51,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:20:51,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:51,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:20:51,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:20:51,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-02-06 09:20:51,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 386 flow. Second operand has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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:20:51,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:51,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-02-06 09:20:51,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:51,676 INFO L124 PetriNetUnfolderBase]: 24/489 cut-off events. [2025-02-06 09:20:51,676 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:20:51,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 489 events. 24/489 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1569 event pairs, 14 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 458. Up to 51 conditions per place. [2025-02-06 09:20:51,680 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 16 selfloop transitions, 9 changer transitions 0/191 dead transitions. [2025-02-06 09:20:51,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 191 transitions, 454 flow [2025-02-06 09:20:51,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:20:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:20:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1521 transitions. [2025-02-06 09:20:51,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2025-02-06 09:20:51,687 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 386 flow. Second operand 9 states and 1521 transitions. [2025-02-06 09:20:51,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 191 transitions, 454 flow [2025-02-06 09:20:51,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 191 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:20:51,691 INFO L231 Difference]: Finished difference. Result has 196 places, 189 transitions, 434 flow [2025-02-06 09:20:51,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=196, PETRI_TRANSITIONS=189} [2025-02-06 09:20:51,692 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 14 predicate places. [2025-02-06 09:20:51,692 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 189 transitions, 434 flow [2025-02-06 09:20:51,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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:20:51,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:51,693 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 09:20:51,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:51,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:51,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1323425749, now seen corresponding path program 2 times [2025-02-06 09:20:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:51,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500207192] [2025-02-06 09:20:51,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:20:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:51,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-02-06 09:20:51,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 105 statements. [2025-02-06 09:20:51,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:20:51,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 09:20:52,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500207192] [2025-02-06 09:20:52,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500207192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:52,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:52,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:52,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047434779] [2025-02-06 09:20:52,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:52,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:52,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:52,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:52,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:20:52,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 189 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 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:20:52,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:52,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:20:52,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:52,984 INFO L124 PetriNetUnfolderBase]: 333/1545 cut-off events. [2025-02-06 09:20:52,985 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:20:52,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 1545 events. 333/1545 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10115 event pairs, 160 based on Foata normal form. 0/1455 useless extension candidates. Maximal degree in co-relation 2144. Up to 544 conditions per place. [2025-02-06 09:20:52,995 INFO L140 encePairwiseOnDemand]: 171/182 looper letters, 36 selfloop transitions, 22 changer transitions 0/218 dead transitions. [2025-02-06 09:20:52,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 218 transitions, 608 flow [2025-02-06 09:20:52,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:20:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:20:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 977 transitions. [2025-02-06 09:20:52,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8946886446886447 [2025-02-06 09:20:53,000 INFO L175 Difference]: Start difference. First operand has 196 places, 189 transitions, 434 flow. Second operand 6 states and 977 transitions. [2025-02-06 09:20:53,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 218 transitions, 608 flow [2025-02-06 09:20:53,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 218 transitions, 602 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:20:53,008 INFO L231 Difference]: Finished difference. Result has 205 places, 210 transitions, 578 flow [2025-02-06 09:20:53,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=205, PETRI_TRANSITIONS=210} [2025-02-06 09:20:53,009 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 23 predicate places. [2025-02-06 09:20:53,009 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 210 transitions, 578 flow [2025-02-06 09:20:53,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 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:20:53,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:53,010 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:53,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:20:53,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1407213627, now seen corresponding path program 1 times [2025-02-06 09:20:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:53,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788156716] [2025-02-06 09:20:53,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:53,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 09:20:53,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 09:20:53,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:53,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788156716] [2025-02-06 09:20:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788156716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:20:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296518010] [2025-02-06 09:20:53,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:53,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:53,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:53,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:20:53,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:20:53,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 09:20:53,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 09:20:53,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:53,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:53,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:20:53,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:20:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:53,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:20:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296518010] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:20:53,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:20:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 09:20:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235487505] [2025-02-06 09:20:53,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:20:53,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:20:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:53,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:20:53,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:20:53,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-02-06 09:20:53,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 210 transitions, 578 flow. Second operand has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 0 states have call successors, (0), 0 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:20:53,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:53,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-02-06 09:20:53,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:53,903 INFO L124 PetriNetUnfolderBase]: 118/1109 cut-off events. [2025-02-06 09:20:53,904 INFO L125 PetriNetUnfolderBase]: For 77/83 co-relation queries the response was YES. [2025-02-06 09:20:53,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 1109 events. 118/1109 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5898 event pairs, 24 based on Foata normal form. 4/1039 useless extension candidates. Maximal degree in co-relation 1418. Up to 133 conditions per place. [2025-02-06 09:20:53,927 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 20 selfloop transitions, 21 changer transitions 0/228 dead transitions. [2025-02-06 09:20:53,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 228 transitions, 748 flow [2025-02-06 09:20:53,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:20:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:20:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3531 transitions. [2025-02-06 09:20:53,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923861852433281 [2025-02-06 09:20:53,936 INFO L175 Difference]: Start difference. First operand has 205 places, 210 transitions, 578 flow. Second operand 21 states and 3531 transitions. [2025-02-06 09:20:53,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 228 transitions, 748 flow [2025-02-06 09:20:53,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 228 transitions, 748 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:20:53,946 INFO L231 Difference]: Finished difference. Result has 230 places, 223 transitions, 708 flow [2025-02-06 09:20:53,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=708, PETRI_PLACES=230, PETRI_TRANSITIONS=223} [2025-02-06 09:20:53,949 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 48 predicate places. [2025-02-06 09:20:53,949 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 223 transitions, 708 flow [2025-02-06 09:20:53,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 0 states have call successors, (0), 0 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:20:53,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:53,952 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:53,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:20:54,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:54,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:54,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:54,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2067257275, now seen corresponding path program 2 times [2025-02-06 09:20:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:54,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987980145] [2025-02-06 09:20:54,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:20:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:54,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-02-06 09:20:54,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 125 statements. [2025-02-06 09:20:54,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:20:54,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 09:20:54,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:54,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987980145] [2025-02-06 09:20:54,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987980145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:54,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:54,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782169798] [2025-02-06 09:20:54,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:54,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:54,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:54,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:54,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:20:54,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 223 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 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:20:54,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:54,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:20:54,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:55,265 INFO L124 PetriNetUnfolderBase]: 505/2412 cut-off events. [2025-02-06 09:20:55,266 INFO L125 PetriNetUnfolderBase]: For 415/445 co-relation queries the response was YES. [2025-02-06 09:20:55,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 2412 events. 505/2412 cut-off events. For 415/445 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 17728 event pairs, 194 based on Foata normal form. 5/2276 useless extension candidates. Maximal degree in co-relation 3909. Up to 824 conditions per place. [2025-02-06 09:20:55,279 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 61 selfloop transitions, 46 changer transitions 0/284 dead transitions. [2025-02-06 09:20:55,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 284 transitions, 1086 flow [2025-02-06 09:20:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:20:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:20:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2025-02-06 09:20:55,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-02-06 09:20:55,282 INFO L175 Difference]: Start difference. First operand has 230 places, 223 transitions, 708 flow. Second operand 6 states and 1001 transitions. [2025-02-06 09:20:55,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 284 transitions, 1086 flow [2025-02-06 09:20:55,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 284 transitions, 1062 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 09:20:55,290 INFO L231 Difference]: Finished difference. Result has 234 places, 268 transitions, 1038 flow [2025-02-06 09:20:55,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1038, PETRI_PLACES=234, PETRI_TRANSITIONS=268} [2025-02-06 09:20:55,291 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 52 predicate places. [2025-02-06 09:20:55,291 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 268 transitions, 1038 flow [2025-02-06 09:20:55,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 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:20:55,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:55,292 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:55,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:20:55,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:55,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1078927013, now seen corresponding path program 1 times [2025-02-06 09:20:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:55,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217939129] [2025-02-06 09:20:55,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:55,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:55,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 09:20:55,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 09:20:55,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:55,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:55,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:55,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217939129] [2025-02-06 09:20:55,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217939129] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:20:55,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954875062] [2025-02-06 09:20:55,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:55,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:20:55,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:55,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:20:55,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 09:20:55,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 09:20:55,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 09:20:55,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:55,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:20:55,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:20:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:55,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:20:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:56,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954875062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:20:56,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:20:56,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 09:20:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13284732] [2025-02-06 09:20:56,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:20:56,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:20:56,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:56,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:20:56,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:20:56,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-02-06 09:20:56,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 268 transitions, 1038 flow. Second operand has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 0 states have call successors, (0), 0 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:20:56,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:56,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-02-06 09:20:56,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:56,739 INFO L124 PetriNetUnfolderBase]: 264/1738 cut-off events. [2025-02-06 09:20:56,740 INFO L125 PetriNetUnfolderBase]: For 589/618 co-relation queries the response was YES. [2025-02-06 09:20:56,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 1738 events. 264/1738 cut-off events. For 589/618 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 11608 event pairs, 40 based on Foata normal form. 13/1667 useless extension candidates. Maximal degree in co-relation 2886. Up to 204 conditions per place. [2025-02-06 09:20:56,752 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 23 selfloop transitions, 30 changer transitions 0/285 dead transitions. [2025-02-06 09:20:56,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 285 transitions, 1266 flow [2025-02-06 09:20:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:20:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:20:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5036 transitions. [2025-02-06 09:20:56,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223443223443224 [2025-02-06 09:20:56,763 INFO L175 Difference]: Start difference. First operand has 234 places, 268 transitions, 1038 flow. Second operand 30 states and 5036 transitions. [2025-02-06 09:20:56,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 285 transitions, 1266 flow [2025-02-06 09:20:56,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 285 transitions, 1266 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:20:56,776 INFO L231 Difference]: Finished difference. Result has 267 places, 278 transitions, 1190 flow [2025-02-06 09:20:56,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1190, PETRI_PLACES=267, PETRI_TRANSITIONS=278} [2025-02-06 09:20:56,778 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 85 predicate places. [2025-02-06 09:20:56,778 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 278 transitions, 1190 flow [2025-02-06 09:20:56,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 0 states have call successors, (0), 0 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:20:56,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:56,780 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 09:20:56,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 09:20:56,980 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:56,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1427340449, now seen corresponding path program 2 times [2025-02-06 09:20:56,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:56,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001906412] [2025-02-06 09:20:56,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:20:56,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:56,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-02-06 09:20:57,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 148 statements. [2025-02-06 09:20:57,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:20:57,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:20:57,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:57,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001906412] [2025-02-06 09:20:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001906412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:57,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620123443] [2025-02-06 09:20:57,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:57,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:57,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:57,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:57,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:57,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-02-06 09:20:57,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 278 transitions, 1190 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 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:20:57,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:57,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-02-06 09:20:57,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:58,065 INFO L124 PetriNetUnfolderBase]: 949/3309 cut-off events. [2025-02-06 09:20:58,065 INFO L125 PetriNetUnfolderBase]: For 2058/2153 co-relation queries the response was YES. [2025-02-06 09:20:58,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7539 conditions, 3309 events. 949/3309 cut-off events. For 2058/2153 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 23816 event pairs, 303 based on Foata normal form. 20/3172 useless extension candidates. Maximal degree in co-relation 7261. Up to 1634 conditions per place. [2025-02-06 09:20:58,085 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 102 selfloop transitions, 57 changer transitions 0/333 dead transitions. [2025-02-06 09:20:58,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 333 transitions, 1752 flow [2025-02-06 09:20:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:20:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:20:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 943 transitions. [2025-02-06 09:20:58,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635531135531136 [2025-02-06 09:20:58,088 INFO L175 Difference]: Start difference. First operand has 267 places, 278 transitions, 1190 flow. Second operand 6 states and 943 transitions. [2025-02-06 09:20:58,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 333 transitions, 1752 flow [2025-02-06 09:20:58,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 333 transitions, 1706 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-06 09:20:58,102 INFO L231 Difference]: Finished difference. Result has 259 places, 325 transitions, 1642 flow [2025-02-06 09:20:58,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1642, PETRI_PLACES=259, PETRI_TRANSITIONS=325} [2025-02-06 09:20:58,103 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 77 predicate places. [2025-02-06 09:20:58,103 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 325 transitions, 1642 flow [2025-02-06 09:20:58,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 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:20:58,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:58,104 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:20:58,104 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:58,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1670237187, now seen corresponding path program 1 times [2025-02-06 09:20:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:58,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114773376] [2025-02-06 09:20:58,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:58,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 09:20:58,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 09:20:58,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:58,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:20:58,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114773376] [2025-02-06 09:20:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114773376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:58,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003238648] [2025-02-06 09:20:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:58,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:58,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:58,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:58,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-02-06 09:20:58,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 325 transitions, 1642 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 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:20:58,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:58,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-02-06 09:20:58,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:59,664 INFO L124 PetriNetUnfolderBase]: 1319/4555 cut-off events. [2025-02-06 09:20:59,665 INFO L125 PetriNetUnfolderBase]: For 4859/4990 co-relation queries the response was YES. [2025-02-06 09:20:59,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11634 conditions, 4555 events. 1319/4555 cut-off events. For 4859/4990 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 35660 event pairs, 341 based on Foata normal form. 40/4406 useless extension candidates. Maximal degree in co-relation 11373. Up to 2190 conditions per place. [2025-02-06 09:20:59,701 INFO L140 encePairwiseOnDemand]: 159/182 looper letters, 143 selfloop transitions, 103 changer transitions 4/426 dead transitions. [2025-02-06 09:20:59,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 426 transitions, 2608 flow [2025-02-06 09:20:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:20:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:20:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 983 transitions. [2025-02-06 09:20:59,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9001831501831502 [2025-02-06 09:20:59,705 INFO L175 Difference]: Start difference. First operand has 259 places, 325 transitions, 1642 flow. Second operand 6 states and 983 transitions. [2025-02-06 09:20:59,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 426 transitions, 2608 flow [2025-02-06 09:20:59,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 426 transitions, 2544 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-02-06 09:20:59,733 INFO L231 Difference]: Finished difference. Result has 269 places, 410 transitions, 2494 flow [2025-02-06 09:20:59,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2494, PETRI_PLACES=269, PETRI_TRANSITIONS=410} [2025-02-06 09:20:59,736 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 87 predicate places. [2025-02-06 09:20:59,736 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 410 transitions, 2494 flow [2025-02-06 09:20:59,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 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:20:59,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:59,737 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:20:59,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:20:59,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:59,738 INFO L85 PathProgramCache]: Analyzing trace with hash 496308676, now seen corresponding path program 1 times [2025-02-06 09:20:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:59,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486556904] [2025-02-06 09:20:59,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:59,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 09:20:59,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:20:59,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:59,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:00,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:00,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486556904] [2025-02-06 09:21:00,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486556904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:00,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:00,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225843672] [2025-02-06 09:21:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:00,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:00,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:00,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:00,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:01,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:01,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 410 transitions, 2494 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:01,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:01,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:01,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:02,901 INFO L124 PetriNetUnfolderBase]: 1231/4917 cut-off events. [2025-02-06 09:21:02,901 INFO L125 PetriNetUnfolderBase]: For 6125/6264 co-relation queries the response was YES. [2025-02-06 09:21:02,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13121 conditions, 4917 events. 1231/4917 cut-off events. For 6125/6264 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 41564 event pairs, 180 based on Foata normal form. 37/4877 useless extension candidates. Maximal degree in co-relation 12843. Up to 712 conditions per place. [2025-02-06 09:21:02,947 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 73 selfloop transitions, 15 changer transitions 0/468 dead transitions. [2025-02-06 09:21:02,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 468 transitions, 2786 flow [2025-02-06 09:21:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1467 transitions. [2025-02-06 09:21:02,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956043956043956 [2025-02-06 09:21:02,951 INFO L175 Difference]: Start difference. First operand has 269 places, 410 transitions, 2494 flow. Second operand 9 states and 1467 transitions. [2025-02-06 09:21:02,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 468 transitions, 2786 flow [2025-02-06 09:21:02,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 468 transitions, 2672 flow, removed 57 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:03,002 INFO L231 Difference]: Finished difference. Result has 284 places, 424 transitions, 2492 flow [2025-02-06 09:21:03,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2380, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2492, PETRI_PLACES=284, PETRI_TRANSITIONS=424} [2025-02-06 09:21:03,004 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 102 predicate places. [2025-02-06 09:21:03,005 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 424 transitions, 2492 flow [2025-02-06 09:21:03,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:03,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:03,006 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:03,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:21:03,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:03,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:03,007 INFO L85 PathProgramCache]: Analyzing trace with hash 510152904, now seen corresponding path program 2 times [2025-02-06 09:21:03,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334987113] [2025-02-06 09:21:03,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:03,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-06 09:21:03,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-06 09:21:03,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:03,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:03,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:03,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334987113] [2025-02-06 09:21:03,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334987113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:03,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:03,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:03,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094599684] [2025-02-06 09:21:03,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:03,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:03,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:03,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:03,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:04,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:04,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 424 transitions, 2492 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:04,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:04,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:04,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:06,128 INFO L124 PetriNetUnfolderBase]: 2479/9316 cut-off events. [2025-02-06 09:21:06,128 INFO L125 PetriNetUnfolderBase]: For 12598/12898 co-relation queries the response was YES. [2025-02-06 09:21:06,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26480 conditions, 9316 events. 2479/9316 cut-off events. For 12598/12898 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 88651 event pairs, 325 based on Foata normal form. 99/9273 useless extension candidates. Maximal degree in co-relation 26194. Up to 1468 conditions per place. [2025-02-06 09:21:06,191 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 119 selfloop transitions, 20 changer transitions 4/523 dead transitions. [2025-02-06 09:21:06,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 523 transitions, 3210 flow [2025-02-06 09:21:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1475 transitions. [2025-02-06 09:21:06,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9004884004884005 [2025-02-06 09:21:06,195 INFO L175 Difference]: Start difference. First operand has 284 places, 424 transitions, 2492 flow. Second operand 9 states and 1475 transitions. [2025-02-06 09:21:06,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 523 transitions, 3210 flow [2025-02-06 09:21:06,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 523 transitions, 3200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:21:06,282 INFO L231 Difference]: Finished difference. Result has 298 places, 441 transitions, 2671 flow [2025-02-06 09:21:06,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2490, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2671, PETRI_PLACES=298, PETRI_TRANSITIONS=441} [2025-02-06 09:21:06,283 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 116 predicate places. [2025-02-06 09:21:06,283 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 441 transitions, 2671 flow [2025-02-06 09:21:06,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:06,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:06,283 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:21:06,284 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:06,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1645867836, now seen corresponding path program 3 times [2025-02-06 09:21:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287062645] [2025-02-06 09:21:06,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:21:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:06,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-02-06 09:21:06,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-06 09:21:06,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 09:21:06,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287062645] [2025-02-06 09:21:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287062645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:06,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:06,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115192123] [2025-02-06 09:21:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:06,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:06,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:06,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:08,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:08,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 441 transitions, 2671 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:08,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:08,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:08,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:10,147 INFO L124 PetriNetUnfolderBase]: 2778/10527 cut-off events. [2025-02-06 09:21:10,148 INFO L125 PetriNetUnfolderBase]: For 16366/16818 co-relation queries the response was YES. [2025-02-06 09:21:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31099 conditions, 10527 events. 2778/10527 cut-off events. For 16366/16818 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 101812 event pairs, 352 based on Foata normal form. 106/10467 useless extension candidates. Maximal degree in co-relation 30805. Up to 1567 conditions per place. [2025-02-06 09:21:10,222 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 123 selfloop transitions, 22 changer transitions 0/525 dead transitions. [2025-02-06 09:21:10,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 525 transitions, 3459 flow [2025-02-06 09:21:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1472 transitions. [2025-02-06 09:21:10,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986568986568987 [2025-02-06 09:21:10,224 INFO L175 Difference]: Start difference. First operand has 298 places, 441 transitions, 2671 flow. Second operand 9 states and 1472 transitions. [2025-02-06 09:21:10,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 525 transitions, 3459 flow [2025-02-06 09:21:10,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 525 transitions, 3421 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:10,333 INFO L231 Difference]: Finished difference. Result has 311 places, 453 transitions, 2840 flow [2025-02-06 09:21:10,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2840, PETRI_PLACES=311, PETRI_TRANSITIONS=453} [2025-02-06 09:21:10,334 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 129 predicate places. [2025-02-06 09:21:10,334 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 453 transitions, 2840 flow [2025-02-06 09:21:10,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:10,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:10,335 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:10,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:21:10,335 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:10,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1851917024, now seen corresponding path program 4 times [2025-02-06 09:21:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800708147] [2025-02-06 09:21:10,337 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:21:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:10,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-02-06 09:21:10,387 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:21:10,387 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 09:21:10,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:11,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800708147] [2025-02-06 09:21:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800708147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:21:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041909640] [2025-02-06 09:21:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:11,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:21:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:11,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:21:11,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:21:12,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:12,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 453 transitions, 2840 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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:21:12,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:12,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:12,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:14,359 INFO L124 PetriNetUnfolderBase]: 3073/11395 cut-off events. [2025-02-06 09:21:14,359 INFO L125 PetriNetUnfolderBase]: For 20248/20704 co-relation queries the response was YES. [2025-02-06 09:21:14,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34824 conditions, 11395 events. 3073/11395 cut-off events. For 20248/20704 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 111221 event pairs, 346 based on Foata normal form. 119/11359 useless extension candidates. Maximal degree in co-relation 34524. Up to 1851 conditions per place. [2025-02-06 09:21:14,448 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 137 selfloop transitions, 28 changer transitions 4/549 dead transitions. [2025-02-06 09:21:14,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 549 transitions, 3825 flow [2025-02-06 09:21:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:21:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:21:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1631 transitions. [2025-02-06 09:21:14,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8961538461538462 [2025-02-06 09:21:14,451 INFO L175 Difference]: Start difference. First operand has 311 places, 453 transitions, 2840 flow. Second operand 10 states and 1631 transitions. [2025-02-06 09:21:14,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 549 transitions, 3825 flow [2025-02-06 09:21:14,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 549 transitions, 3746 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-06 09:21:14,592 INFO L231 Difference]: Finished difference. Result has 322 places, 465 transitions, 3021 flow [2025-02-06 09:21:14,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2814, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3021, PETRI_PLACES=322, PETRI_TRANSITIONS=465} [2025-02-06 09:21:14,595 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 140 predicate places. [2025-02-06 09:21:14,595 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 465 transitions, 3021 flow [2025-02-06 09:21:14,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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:21:14,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:14,597 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:14,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:21:14,597 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:14,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1516329702, now seen corresponding path program 5 times [2025-02-06 09:21:14,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:14,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825991854] [2025-02-06 09:21:14,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:21:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:14,616 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-06 09:21:14,643 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:21:14,643 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 09:21:14,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-02-06 09:21:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:15,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825991854] [2025-02-06 09:21:15,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825991854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:21:15,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611744288] [2025-02-06 09:21:15,468 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:21:15,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:15,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:21:15,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:21:15,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 09:21:15,553 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-06 09:21:15,632 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:21:15,632 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 09:21:15,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:15,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 09:21:15,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:21:15,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 09:21:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:16,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:21:16,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611744288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:16,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:21:16,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-02-06 09:21:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613764033] [2025-02-06 09:21:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:16,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:21:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:16,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:21:16,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:21:17,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:17,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 465 transitions, 3021 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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:21:17,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:17,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:17,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:19,374 INFO L124 PetriNetUnfolderBase]: 3406/12720 cut-off events. [2025-02-06 09:21:19,374 INFO L125 PetriNetUnfolderBase]: For 25302/25896 co-relation queries the response was YES. [2025-02-06 09:21:19,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39483 conditions, 12720 events. 3406/12720 cut-off events. For 25302/25896 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 126906 event pairs, 382 based on Foata normal form. 112/12645 useless extension candidates. Maximal degree in co-relation 39177. Up to 1959 conditions per place. [2025-02-06 09:21:19,445 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 136 selfloop transitions, 30 changer transitions 0/546 dead transitions. [2025-02-06 09:21:19,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 546 transitions, 4004 flow [2025-02-06 09:21:19,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:21:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:21:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1628 transitions. [2025-02-06 09:21:19,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8945054945054945 [2025-02-06 09:21:19,446 INFO L175 Difference]: Start difference. First operand has 322 places, 465 transitions, 3021 flow. Second operand 10 states and 1628 transitions. [2025-02-06 09:21:19,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 546 transitions, 4004 flow [2025-02-06 09:21:19,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 546 transitions, 3911 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-02-06 09:21:19,542 INFO L231 Difference]: Finished difference. Result has 333 places, 480 transitions, 3259 flow [2025-02-06 09:21:19,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2978, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3259, PETRI_PLACES=333, PETRI_TRANSITIONS=480} [2025-02-06 09:21:19,543 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 151 predicate places. [2025-02-06 09:21:19,543 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 480 transitions, 3259 flow [2025-02-06 09:21:19,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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:21:19,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:19,543 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:19,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 09:21:19,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 09:21:19,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:19,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:19,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1220419554, now seen corresponding path program 6 times [2025-02-06 09:21:19,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239785094] [2025-02-06 09:21:19,745 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 09:21:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:19,759 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-02-06 09:21:19,769 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-06 09:21:19,769 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 09:21:19,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:19,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239785094] [2025-02-06 09:21:19,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239785094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:19,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:19,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:19,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444929672] [2025-02-06 09:21:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:19,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:19,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:19,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:19,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:21,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:21,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 480 transitions, 3259 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:21,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:21,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:21,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:23,609 INFO L124 PetriNetUnfolderBase]: 3725/13728 cut-off events. [2025-02-06 09:21:23,609 INFO L125 PetriNetUnfolderBase]: For 31550/32164 co-relation queries the response was YES. [2025-02-06 09:21:23,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43944 conditions, 13728 events. 3725/13728 cut-off events. For 31550/32164 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 138859 event pairs, 386 based on Foata normal form. 120/13668 useless extension candidates. Maximal degree in co-relation 43632. Up to 2232 conditions per place. [2025-02-06 09:21:23,689 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 154 selfloop transitions, 34 changer transitions 2/570 dead transitions. [2025-02-06 09:21:23,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 570 transitions, 4410 flow [2025-02-06 09:21:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-02-06 09:21:23,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-02-06 09:21:23,690 INFO L175 Difference]: Start difference. First operand has 333 places, 480 transitions, 3259 flow. Second operand 9 states and 1479 transitions. [2025-02-06 09:21:23,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 570 transitions, 4410 flow [2025-02-06 09:21:23,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 570 transitions, 4312 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-02-06 09:21:23,817 INFO L231 Difference]: Finished difference. Result has 344 places, 495 transitions, 3504 flow [2025-02-06 09:21:23,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3198, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3504, PETRI_PLACES=344, PETRI_TRANSITIONS=495} [2025-02-06 09:21:23,818 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 162 predicate places. [2025-02-06 09:21:23,818 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 495 transitions, 3504 flow [2025-02-06 09:21:23,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:23,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:23,818 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:23,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:21:23,819 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:23,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:23,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1576277874, now seen corresponding path program 7 times [2025-02-06 09:21:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:23,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184519075] [2025-02-06 09:21:23,820 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 09:21:23,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:23,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 09:21:23,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:21:23,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:23,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:24,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:24,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184519075] [2025-02-06 09:21:24,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184519075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:24,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:24,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066848390] [2025-02-06 09:21:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:24,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:24,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:24,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:24,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:25,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:25,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 495 transitions, 3504 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:25,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:25,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:25,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:27,595 INFO L124 PetriNetUnfolderBase]: 4068/15087 cut-off events. [2025-02-06 09:21:27,595 INFO L125 PetriNetUnfolderBase]: For 39976/40637 co-relation queries the response was YES. [2025-02-06 09:21:27,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49325 conditions, 15087 events. 4068/15087 cut-off events. For 39976/40637 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 155897 event pairs, 478 based on Foata normal form. 107/14981 useless extension candidates. Maximal degree in co-relation 49008. Up to 2363 conditions per place. [2025-02-06 09:21:27,699 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 150 selfloop transitions, 36 changer transitions 0/566 dead transitions. [2025-02-06 09:21:27,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 566 transitions, 4606 flow [2025-02-06 09:21:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1477 transitions. [2025-02-06 09:21:27,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017094017094017 [2025-02-06 09:21:27,701 INFO L175 Difference]: Start difference. First operand has 344 places, 495 transitions, 3504 flow. Second operand 9 states and 1477 transitions. [2025-02-06 09:21:27,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 566 transitions, 4606 flow [2025-02-06 09:21:27,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 566 transitions, 4506 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-02-06 09:21:27,874 INFO L231 Difference]: Finished difference. Result has 357 places, 514 transitions, 3855 flow [2025-02-06 09:21:27,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3855, PETRI_PLACES=357, PETRI_TRANSITIONS=514} [2025-02-06 09:21:27,875 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 175 predicate places. [2025-02-06 09:21:27,875 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 514 transitions, 3855 flow [2025-02-06 09:21:27,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:27,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:27,876 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:27,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:21:27,876 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:27,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2116917232, now seen corresponding path program 8 times [2025-02-06 09:21:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:27,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876918570] [2025-02-06 09:21:27,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:27,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:27,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-06 09:21:27,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-06 09:21:27,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:27,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:28,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:28,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876918570] [2025-02-06 09:21:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876918570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:28,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:28,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285541777] [2025-02-06 09:21:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:28,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:28,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:28,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:28,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:28,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 514 transitions, 3855 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:28,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:28,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:28,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:32,047 INFO L124 PetriNetUnfolderBase]: 4671/16951 cut-off events. [2025-02-06 09:21:32,047 INFO L125 PetriNetUnfolderBase]: For 51043/51927 co-relation queries the response was YES. [2025-02-06 09:21:32,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57058 conditions, 16951 events. 4671/16951 cut-off events. For 51043/51927 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 179812 event pairs, 469 based on Foata normal form. 137/16875 useless extension candidates. Maximal degree in co-relation 56734. Up to 2778 conditions per place. [2025-02-06 09:21:32,200 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 173 selfloop transitions, 45 changer transitions 0/598 dead transitions. [2025-02-06 09:21:32,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 598 transitions, 5172 flow [2025-02-06 09:21:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1481 transitions. [2025-02-06 09:21:32,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9041514041514042 [2025-02-06 09:21:32,202 INFO L175 Difference]: Start difference. First operand has 357 places, 514 transitions, 3855 flow. Second operand 9 states and 1481 transitions. [2025-02-06 09:21:32,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 598 transitions, 5172 flow [2025-02-06 09:21:32,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 598 transitions, 5068 flow, removed 52 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:32,429 INFO L231 Difference]: Finished difference. Result has 372 places, 532 transitions, 4209 flow [2025-02-06 09:21:32,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3751, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4209, PETRI_PLACES=372, PETRI_TRANSITIONS=532} [2025-02-06 09:21:32,430 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 190 predicate places. [2025-02-06 09:21:32,430 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 532 transitions, 4209 flow [2025-02-06 09:21:32,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:32,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:32,431 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:32,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:21:32,431 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash 487230494, now seen corresponding path program 9 times [2025-02-06 09:21:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645185951] [2025-02-06 09:21:32,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:21:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:32,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-02-06 09:21:32,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-06 09:21:32,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 09:21:32,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645185951] [2025-02-06 09:21:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645185951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765624859] [2025-02-06 09:21:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:32,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:33,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:33,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 532 transitions, 4209 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:33,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:33,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:33,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:37,020 INFO L124 PetriNetUnfolderBase]: 4663/17065 cut-off events. [2025-02-06 09:21:37,020 INFO L125 PetriNetUnfolderBase]: For 56745/57647 co-relation queries the response was YES. [2025-02-06 09:21:37,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58128 conditions, 17065 events. 4663/17065 cut-off events. For 56745/57647 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 181799 event pairs, 445 based on Foata normal form. 223/17085 useless extension candidates. Maximal degree in co-relation 57796. Up to 2699 conditions per place. [2025-02-06 09:21:37,126 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 185 selfloop transitions, 58 changer transitions 0/623 dead transitions. [2025-02-06 09:21:37,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 623 transitions, 5535 flow [2025-02-06 09:21:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1470 transitions. [2025-02-06 09:21:37,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-02-06 09:21:37,127 INFO L175 Difference]: Start difference. First operand has 372 places, 532 transitions, 4209 flow. Second operand 9 states and 1470 transitions. [2025-02-06 09:21:37,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 623 transitions, 5535 flow [2025-02-06 09:21:37,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 623 transitions, 5447 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-02-06 09:21:37,348 INFO L231 Difference]: Finished difference. Result has 384 places, 544 transitions, 4449 flow [2025-02-06 09:21:37,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4123, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4449, PETRI_PLACES=384, PETRI_TRANSITIONS=544} [2025-02-06 09:21:37,349 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 202 predicate places. [2025-02-06 09:21:37,349 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 544 transitions, 4449 flow [2025-02-06 09:21:37,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:37,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:37,350 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:37,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:21:37,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:37,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1094714860, now seen corresponding path program 10 times [2025-02-06 09:21:37,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:37,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894055500] [2025-02-06 09:21:37,351 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:21:37,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:37,363 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-02-06 09:21:37,377 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:21:37,377 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 09:21:37,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:37,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:37,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894055500] [2025-02-06 09:21:37,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894055500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:37,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:37,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:21:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717482502] [2025-02-06 09:21:37,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:37,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:21:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:37,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:21:37,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:21:38,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:38,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 544 transitions, 4449 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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:21:38,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:38,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:38,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:41,737 INFO L124 PetriNetUnfolderBase]: 4388/16276 cut-off events. [2025-02-06 09:21:41,737 INFO L125 PetriNetUnfolderBase]: For 58688/59591 co-relation queries the response was YES. [2025-02-06 09:21:41,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56085 conditions, 16276 events. 4388/16276 cut-off events. For 58688/59591 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 171668 event pairs, 426 based on Foata normal form. 205/16278 useless extension candidates. Maximal degree in co-relation 55748. Up to 2535 conditions per place. [2025-02-06 09:21:41,883 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 185 selfloop transitions, 55 changer transitions 0/620 dead transitions. [2025-02-06 09:21:41,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 620 transitions, 5663 flow [2025-02-06 09:21:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:21:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:21:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1621 transitions. [2025-02-06 09:21:41,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8906593406593407 [2025-02-06 09:21:41,886 INFO L175 Difference]: Start difference. First operand has 384 places, 544 transitions, 4449 flow. Second operand 10 states and 1621 transitions. [2025-02-06 09:21:41,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 620 transitions, 5663 flow [2025-02-06 09:21:42,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 620 transitions, 5481 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-02-06 09:21:42,156 INFO L231 Difference]: Finished difference. Result has 392 places, 547 transitions, 4483 flow [2025-02-06 09:21:42,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4279, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4483, PETRI_PLACES=392, PETRI_TRANSITIONS=547} [2025-02-06 09:21:42,157 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 210 predicate places. [2025-02-06 09:21:42,157 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 547 transitions, 4483 flow [2025-02-06 09:21:42,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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:21:42,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:42,157 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:21:42,158 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:42,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1274962040, now seen corresponding path program 11 times [2025-02-06 09:21:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878419340] [2025-02-06 09:21:42,159 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:21:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:42,171 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-06 09:21:42,182 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:21:42,183 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 09:21:42,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-02-06 09:21:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878419340] [2025-02-06 09:21:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878419340] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:21:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375784299] [2025-02-06 09:21:42,907 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 09:21:42,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:21:42,909 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:21:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 09:21:42,985 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-02-06 09:21:43,033 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:21:43,033 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-06 09:21:43,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:43,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 09:21:43,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:21:43,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 09:21:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:43,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:21:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375784299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:21:43,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-02-06 09:21:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234582926] [2025-02-06 09:21:43,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:43,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:21:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:43,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:21:43,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:21:44,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:44,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 547 transitions, 4483 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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:21:44,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:44,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:44,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:47,089 INFO L124 PetriNetUnfolderBase]: 4390/16303 cut-off events. [2025-02-06 09:21:47,089 INFO L125 PetriNetUnfolderBase]: For 56430/57210 co-relation queries the response was YES. [2025-02-06 09:21:47,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56006 conditions, 16303 events. 4390/16303 cut-off events. For 56430/57210 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 171969 event pairs, 450 based on Foata normal form. 175/16273 useless extension candidates. Maximal degree in co-relation 55665. Up to 2566 conditions per place. [2025-02-06 09:21:47,251 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 179 selfloop transitions, 61 changer transitions 0/620 dead transitions. [2025-02-06 09:21:47,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 620 transitions, 5647 flow [2025-02-06 09:21:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:21:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:21:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1624 transitions. [2025-02-06 09:21:47,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2025-02-06 09:21:47,253 INFO L175 Difference]: Start difference. First operand has 392 places, 547 transitions, 4483 flow. Second operand 10 states and 1624 transitions. [2025-02-06 09:21:47,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 620 transitions, 5647 flow [2025-02-06 09:21:47,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 620 transitions, 5529 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-06 09:21:47,488 INFO L231 Difference]: Finished difference. Result has 400 places, 558 transitions, 4735 flow [2025-02-06 09:21:47,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4383, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4735, PETRI_PLACES=400, PETRI_TRANSITIONS=558} [2025-02-06 09:21:47,489 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 218 predicate places. [2025-02-06 09:21:47,489 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 558 transitions, 4735 flow [2025-02-06 09:21:47,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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:21:47,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:47,490 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:47,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 09:21:47,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:21:47,690 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:47,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:47,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2102762288, now seen corresponding path program 12 times [2025-02-06 09:21:47,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:47,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151991266] [2025-02-06 09:21:47,691 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 09:21:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:47,700 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-02-06 09:21:47,704 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-06 09:21:47,704 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-06 09:21:47,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:47,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:47,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151991266] [2025-02-06 09:21:47,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151991266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:47,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:47,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:47,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033835004] [2025-02-06 09:21:47,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:47,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:47,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:47,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:47,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:48,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:48,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 558 transitions, 4735 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:48,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:48,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:48,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:52,462 INFO L124 PetriNetUnfolderBase]: 4679/17288 cut-off events. [2025-02-06 09:21:52,462 INFO L125 PetriNetUnfolderBase]: For 63711/64533 co-relation queries the response was YES. [2025-02-06 09:21:52,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59966 conditions, 17288 events. 4679/17288 cut-off events. For 63711/64533 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 184587 event pairs, 475 based on Foata normal form. 163/17232 useless extension candidates. Maximal degree in co-relation 59620. Up to 2741 conditions per place. [2025-02-06 09:21:52,778 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 203 selfloop transitions, 49 changer transitions 0/632 dead transitions. [2025-02-06 09:21:52,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 632 transitions, 6071 flow [2025-02-06 09:21:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-02-06 09:21:52,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-02-06 09:21:52,780 INFO L175 Difference]: Start difference. First operand has 400 places, 558 transitions, 4735 flow. Second operand 9 states and 1479 transitions. [2025-02-06 09:21:52,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 632 transitions, 6071 flow [2025-02-06 09:21:53,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 632 transitions, 5865 flow, removed 73 selfloop flow, removed 4 redundant places. [2025-02-06 09:21:53,038 INFO L231 Difference]: Finished difference. Result has 408 places, 568 transitions, 4915 flow [2025-02-06 09:21:53,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4627, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4915, PETRI_PLACES=408, PETRI_TRANSITIONS=568} [2025-02-06 09:21:53,039 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 226 predicate places. [2025-02-06 09:21:53,039 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 568 transitions, 4915 flow [2025-02-06 09:21:53,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:53,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:53,039 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:53,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:21:53,040 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:53,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash -278668322, now seen corresponding path program 13 times [2025-02-06 09:21:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:53,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219047376] [2025-02-06 09:21:53,041 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 09:21:53,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:53,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 09:21:53,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:21:53,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:21:53,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219047376] [2025-02-06 09:21:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219047376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:53,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:53,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760624931] [2025-02-06 09:21:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:53,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:53,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:53,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:53,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:54,083 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:54,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 568 transitions, 4915 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:54,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:54,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:54,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:21:57,488 INFO L124 PetriNetUnfolderBase]: 4685/17399 cut-off events. [2025-02-06 09:21:57,488 INFO L125 PetriNetUnfolderBase]: For 62894/63727 co-relation queries the response was YES. [2025-02-06 09:21:57,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60279 conditions, 17399 events. 4685/17399 cut-off events. For 62894/63727 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 186392 event pairs, 453 based on Foata normal form. 184/17371 useless extension candidates. Maximal degree in co-relation 59930. Up to 2755 conditions per place. [2025-02-06 09:21:57,643 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 192 selfloop transitions, 66 changer transitions 0/638 dead transitions. [2025-02-06 09:21:57,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 638 transitions, 6128 flow [2025-02-06 09:21:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:21:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:21:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1473 transitions. [2025-02-06 09:21:57,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992673992673993 [2025-02-06 09:21:57,646 INFO L175 Difference]: Start difference. First operand has 408 places, 568 transitions, 4915 flow. Second operand 9 states and 1473 transitions. [2025-02-06 09:21:57,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 638 transitions, 6128 flow [2025-02-06 09:21:57,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 638 transitions, 6031 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-02-06 09:21:57,948 INFO L231 Difference]: Finished difference. Result has 415 places, 577 transitions, 5143 flow [2025-02-06 09:21:57,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4827, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5143, PETRI_PLACES=415, PETRI_TRANSITIONS=577} [2025-02-06 09:21:57,949 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 233 predicate places. [2025-02-06 09:21:57,949 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 577 transitions, 5143 flow [2025-02-06 09:21:57,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:57,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:21:57,950 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:21:57,950 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-06 09:21:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:21:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1673346218, now seen corresponding path program 14 times [2025-02-06 09:21:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:21:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406559] [2025-02-06 09:21:57,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:21:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:21:57,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-02-06 09:21:57,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-02-06 09:21:57,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:21:57,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:21:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-06 09:21:58,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:21:58,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406559] [2025-02-06 09:21:58,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:21:58,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:21:58,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 09:21:58,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135912692] [2025-02-06 09:21:58,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:21:58,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 09:21:58,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:21:58,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 09:21:58,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 09:21:59,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-02-06 09:21:59,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 577 transitions, 5143 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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:21:59,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:21:59,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-02-06 09:21:59,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand