./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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/pthread-ext/09_fmaxsym.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 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:10:16,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:10:16,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:10:16,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:10:16,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:10:16,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:10:16,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:10:16,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:10:16,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:10:16,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:10:16,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:10:16,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:10:16,543 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:10:16,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:10:16,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:10:16,544 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:10:16,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:10:16,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:10:16,545 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 -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-02-08 05:10:16,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:10:16,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:10:16,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:10:16,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:10:16,774 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:10:16,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-08 05:10:17,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3a297e61/4f9e580acbf444bdabfa2c3de6864b8c/FLAG960bba3cc [2025-02-08 05:10:18,232 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:10:18,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-02-08 05:10:18,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3a297e61/4f9e580acbf444bdabfa2c3de6864b8c/FLAG960bba3cc [2025-02-08 05:10:18,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3a297e61/4f9e580acbf444bdabfa2c3de6864b8c [2025-02-08 05:10:18,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:10:18,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:10:18,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:10:18,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:10:18,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:10:18,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d3808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18, skipping insertion in model container [2025-02-08 05:10:18,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:10:18,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:10:18,739 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:10:18,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:10:18,801 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:10:18,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18 WrapperNode [2025-02-08 05:10:18,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:10:18,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:10:18,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:10:18,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:10:18,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,836 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 103 [2025-02-08 05:10:18,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:10:18,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:10:18,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:10:18,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:10:18,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:10:18,856 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:10:18,856 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:10:18,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:10:18,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (1/1) ... [2025-02-08 05:10:18,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:10:18,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:18,889 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-08 05:10:18,892 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-08 05:10:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:10:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:10:18,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:10:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:10:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:10:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:10:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:10:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:10:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:10:18,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:10:18,911 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:10:19,006 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:10:19,009 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:10:19,238 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:10:19,239 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:10:19,264 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:10:19,266 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:10:19,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:10:19 BoogieIcfgContainer [2025-02-08 05:10:19,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:10:19,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:10:19,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:10:19,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:10:19,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:10:18" (1/3) ... [2025-02-08 05:10:19,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58309715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:10:19, skipping insertion in model container [2025-02-08 05:10:19,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:18" (2/3) ... [2025-02-08 05:10:19,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58309715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:10:19, skipping insertion in model container [2025-02-08 05:10:19,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:10:19" (3/3) ... [2025-02-08 05:10:19,275 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-02-08 05:10:19,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:10:19,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym.i that has 2 procedures, 114 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-02-08 05:10:19,290 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:10:19,362 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:19,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 120 transitions, 244 flow [2025-02-08 05:10:19,437 INFO L124 PetriNetUnfolderBase]: 6/127 cut-off events. [2025-02-08 05:10:19,439 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:19,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 137 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2025-02-08 05:10:19,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 120 transitions, 244 flow [2025-02-08 05:10:19,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 120 transitions, 244 flow [2025-02-08 05:10:19,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:19,470 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;@79836e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:19,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 05:10:19,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:19,487 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-08 05:10:19,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:19,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:19,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:10:19,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:10:19,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash 383866432, now seen corresponding path program 1 times [2025-02-08 05:10:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541352926] [2025-02-08 05:10:19,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:19,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:19,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:10:19,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:10:19,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:19,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:20,107 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-08 05:10:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:20,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541352926] [2025-02-08 05:10:20,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541352926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:20,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:20,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:10:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820401018] [2025-02-08 05:10:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:20,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:10:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:20,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:10:20,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:10:20,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2025-02-08 05:10:20,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 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-08 05:10:20,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:20,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2025-02-08 05:10:20,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:20,376 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2025-02-08 05:10:20,377 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:10:20,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 113 events. 3/113 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 80 event pairs, 0 based on Foata normal form. 13/117 useless extension candidates. Maximal degree in co-relation 75. Up to 16 conditions per place. [2025-02-08 05:10:20,379 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 15 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-02-08 05:10:20,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 264 flow [2025-02-08 05:10:20,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:10:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:10:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2025-02-08 05:10:20,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-02-08 05:10:20,396 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 244 flow. Second operand 6 states and 583 transitions. [2025-02-08 05:10:20,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 264 flow [2025-02-08 05:10:20,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:20,402 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 234 flow [2025-02-08 05:10:20,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2025-02-08 05:10:20,408 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-02-08 05:10:20,408 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 234 flow [2025-02-08 05:10:20,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 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-08 05:10:20,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:20,411 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:20,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:10:20,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:10:20,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:20,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1737443141, now seen corresponding path program 1 times [2025-02-08 05:10:20,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:20,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063443000] [2025-02-08 05:10:20,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:20,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:10:20,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:10:20,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:20,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:20,462 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-08 05:10:20,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:20,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063443000] [2025-02-08 05:10:20,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063443000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:20,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:20,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:10:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233267369] [2025-02-08 05:10:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:20,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:20,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:20,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:20,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-02-08 05:10:20,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-08 05:10:20,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:20,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-02-08 05:10:20,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:20,530 INFO L124 PetriNetUnfolderBase]: 3/125 cut-off events. [2025-02-08 05:10:20,530 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:10:20,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 125 events. 3/125 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 1/118 useless extension candidates. Maximal degree in co-relation 90. Up to 11 conditions per place. [2025-02-08 05:10:20,531 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 9 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-02-08 05:10:20,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 260 flow [2025-02-08 05:10:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-02-08 05:10:20,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-02-08 05:10:20,533 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 234 flow. Second operand 3 states and 324 transitions. [2025-02-08 05:10:20,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 260 flow [2025-02-08 05:10:20,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 111 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:10:20,538 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 236 flow [2025-02-08 05:10:20,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2025-02-08 05:10:20,540 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-02-08 05:10:20,540 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 236 flow [2025-02-08 05:10:20,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-08 05:10:20,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:20,541 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:20,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:10:20,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:10:20,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1408676174, now seen corresponding path program 1 times [2025-02-08 05:10:20,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:20,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168513467] [2025-02-08 05:10:20,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:20,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:10:20,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:10:20,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:20,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:20,675 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-08 05:10:20,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168513467] [2025-02-08 05:10:20,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168513467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:10:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511939302] [2025-02-08 05:10:20,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:20,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:20,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:20,680 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-08 05:10:20,681 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-08 05:10:20,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:10:20,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:10:20,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:20,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:20,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:10:20,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:10:20,808 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-08 05:10:20,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:10:20,863 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-08 05:10:20,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511939302] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:10:20,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:10:20,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:10:20,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094052428] [2025-02-08 05:10:20,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:10:20,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:10:20,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:20,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:10:20,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:10:20,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-02-08 05:10:20,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 236 flow. Second operand has 10 states, 10 states have (on average 102.9) internal successors, (1029), 10 states have internal predecessors, (1029), 0 states have call successors, (0), 0 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-08 05:10:20,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:20,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-02-08 05:10:20,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:21,056 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2025-02-08 05:10:21,057 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:10:21,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 140 events. 3/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 125. Up to 11 conditions per place. [2025-02-08 05:10:21,058 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 13 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2025-02-08 05:10:21,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 298 flow [2025-02-08 05:10:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:10:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:10:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 933 transitions. [2025-02-08 05:10:21,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8638888888888889 [2025-02-08 05:10:21,062 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 236 flow. Second operand 9 states and 933 transitions. [2025-02-08 05:10:21,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 298 flow [2025-02-08 05:10:21,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 119 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:10:21,065 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 284 flow [2025-02-08 05:10:21,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=284, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2025-02-08 05:10:21,067 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-02-08 05:10:21,067 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 284 flow [2025-02-08 05:10:21,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 102.9) internal successors, (1029), 10 states have internal predecessors, (1029), 0 states have call successors, (0), 0 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-08 05:10:21,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:21,068 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:21,074 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-08 05:10:21,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:21,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:10:21,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash 195567278, now seen corresponding path program 2 times [2025-02-08 05:10:21,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:21,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718452019] [2025-02-08 05:10:21,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:10:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:21,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-08 05:10:21,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:10:21,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:10:21,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:21,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:21,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718452019] [2025-02-08 05:10:21,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718452019] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:10:21,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044755867] [2025-02-08 05:10:21,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:10:21,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:21,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:21,473 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-08 05:10:21,474 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-08 05:10:21,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-02-08 05:10:21,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:10:21,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:10:21,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:21,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:10:21,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:10:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:21,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:10:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:21,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044755867] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:10:21,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:10:21,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-08 05:10:21,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95330348] [2025-02-08 05:10:21,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:10:21,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:10:21,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:21,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:10:21,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:10:21,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-02-08 05:10:21,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 284 flow. Second operand has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 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-08 05:10:21,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:21,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-02-08 05:10:21,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:22,031 INFO L124 PetriNetUnfolderBase]: 3/179 cut-off events. [2025-02-08 05:10:22,031 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 05:10:22,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 179 events. 3/179 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 3/174 useless extension candidates. Maximal degree in co-relation 185. Up to 11 conditions per place. [2025-02-08 05:10:22,032 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 16 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2025-02-08 05:10:22,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 131 transitions, 426 flow [2025-02-08 05:10:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 05:10:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-08 05:10:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1855 transitions. [2025-02-08 05:10:22,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8587962962962963 [2025-02-08 05:10:22,040 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 284 flow. Second operand 18 states and 1855 transitions. [2025-02-08 05:10:22,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 131 transitions, 426 flow [2025-02-08 05:10:22,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 131 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-08 05:10:22,045 INFO L231 Difference]: Finished difference. Result has 143 places, 127 transitions, 384 flow [2025-02-08 05:10:22,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=384, PETRI_PLACES=143, PETRI_TRANSITIONS=127} [2025-02-08 05:10:22,046 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-02-08 05:10:22,046 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 127 transitions, 384 flow [2025-02-08 05:10:22,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 103.06666666666666) internal successors, (1546), 15 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-08 05:10:22,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:22,047 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:22,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:10:22,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:22,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:10:22,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1562587941, now seen corresponding path program 3 times [2025-02-08 05:10:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931179798] [2025-02-08 05:10:22,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:10:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:22,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-02-08 05:10:22,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:10:22,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 05:10:22,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:22,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:22,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:10:22,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:10:22,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:22,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:22,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:22,368 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:22,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-08 05:10:22,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-08 05:10:22,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-08 05:10:22,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-08 05:10:22,370 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-08 05:10:22,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-08 05:10:22,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-08 05:10:22,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-08 05:10:22,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-08 05:10:22,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-08 05:10:22,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:10:22,371 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-08 05:10:22,374 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:22,374 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:10:22,402 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:22,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 188 transitions, 386 flow [2025-02-08 05:10:22,422 INFO L124 PetriNetUnfolderBase]: 11/204 cut-off events. [2025-02-08 05:10:22,422 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:10:22,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 204 events. 11/204 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 393 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 143. Up to 3 conditions per place. [2025-02-08 05:10:22,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 188 transitions, 386 flow [2025-02-08 05:10:22,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 188 transitions, 386 flow [2025-02-08 05:10:22,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:22,426 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;@79836e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:22,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-08 05:10:22,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:22,430 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-08 05:10:22,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:22,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:22,430 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] [2025-02-08 05:10:22,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:10:22,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash 866170748, now seen corresponding path program 1 times [2025-02-08 05:10:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:22,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692814438] [2025-02-08 05:10:22,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:22,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:22,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:10:22,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:10:22,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:22,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:22,635 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-08 05:10:22,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:22,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692814438] [2025-02-08 05:10:22,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692814438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:22,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:22,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:10:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969241176] [2025-02-08 05:10:22,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:22,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:10:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:22,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:10:22,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:10:22,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2025-02-08 05:10:22,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 386 flow. Second operand has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 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-08 05:10:22,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:22,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2025-02-08 05:10:22,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:22,884 INFO L124 PetriNetUnfolderBase]: 104/725 cut-off events. [2025-02-08 05:10:22,885 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 05:10:22,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 725 events. 104/725 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3754 event pairs, 72 based on Foata normal form. 136/754 useless extension candidates. Maximal degree in co-relation 669. Up to 185 conditions per place. [2025-02-08 05:10:22,892 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 24 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2025-02-08 05:10:22,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 414 flow [2025-02-08 05:10:22,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:10:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:10:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 925 transitions. [2025-02-08 05:10:22,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200354609929078 [2025-02-08 05:10:22,895 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 386 flow. Second operand 6 states and 925 transitions. [2025-02-08 05:10:22,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 414 flow [2025-02-08 05:10:22,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 173 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:22,898 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 366 flow [2025-02-08 05:10:22,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=178, PETRI_TRANSITIONS=173} [2025-02-08 05:10:22,899 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-02-08 05:10:22,900 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 366 flow [2025-02-08 05:10:22,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 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-08 05:10:22,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:22,900 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:22,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:10:22,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:10:22,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:22,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1833094792, now seen corresponding path program 1 times [2025-02-08 05:10:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:22,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493929530] [2025-02-08 05:10:22,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:22,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:22,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:10:22,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:10:22,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:22,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:22,931 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-08 05:10:22,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:22,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493929530] [2025-02-08 05:10:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493929530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:22,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:10:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968399240] [2025-02-08 05:10:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:22,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:22,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:22,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:22,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 188 [2025-02-08 05:10:22,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-08 05:10:22,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:22,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 188 [2025-02-08 05:10:22,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:23,005 INFO L124 PetriNetUnfolderBase]: 33/489 cut-off events. [2025-02-08 05:10:23,005 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:10:23,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 489 events. 33/489 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2016 event pairs, 20 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 514. Up to 56 conditions per place. [2025-02-08 05:10:23,012 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2025-02-08 05:10:23,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 174 transitions, 402 flow [2025-02-08 05:10:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-02-08 05:10:23,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-02-08 05:10:23,013 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 366 flow. Second operand 3 states and 506 transitions. [2025-02-08 05:10:23,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 174 transitions, 402 flow [2025-02-08 05:10:23,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 174 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:10:23,016 INFO L231 Difference]: Finished difference. Result has 176 places, 174 transitions, 368 flow [2025-02-08 05:10:23,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=176, PETRI_TRANSITIONS=174} [2025-02-08 05:10:23,018 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-02-08 05:10:23,018 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 174 transitions, 368 flow [2025-02-08 05:10:23,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 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-08 05:10:23,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:23,019 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:23,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:10:23,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:10:23,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash 529971837, now seen corresponding path program 1 times [2025-02-08 05:10:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:23,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561905603] [2025-02-08 05:10:23,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:23,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:23,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:10:23,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:10:23,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:23,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:23,067 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-08 05:10:23,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:23,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561905603] [2025-02-08 05:10:23,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561905603] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:10:23,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791438448] [2025-02-08 05:10:23,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:23,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:23,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:23,070 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-08 05:10:23,071 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-08 05:10:23,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:10:23,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:10:23,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:23,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:23,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:10:23,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:10:23,159 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-08 05:10:23,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:10:23,188 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-08 05:10:23,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791438448] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:10:23,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:10:23,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:10:23,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596389759] [2025-02-08 05:10:23,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:10:23,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:10:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:23,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:10:23,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:10:23,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-02-08 05:10:23,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 174 transitions, 368 flow. Second operand has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 0 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-08 05:10:23,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:23,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-02-08 05:10:23,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:23,343 INFO L124 PetriNetUnfolderBase]: 33/504 cut-off events. [2025-02-08 05:10:23,344 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-08 05:10:23,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 504 events. 33/504 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1987 event pairs, 20 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 549. Up to 56 conditions per place. [2025-02-08 05:10:23,346 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 18 selfloop transitions, 9 changer transitions 0/182 dead transitions. [2025-02-08 05:10:23,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 440 flow [2025-02-08 05:10:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:10:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:10:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1469 transitions. [2025-02-08 05:10:23,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682033096926713 [2025-02-08 05:10:23,349 INFO L175 Difference]: Start difference. First operand has 176 places, 174 transitions, 368 flow. Second operand 9 states and 1469 transitions. [2025-02-08 05:10:23,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 440 flow [2025-02-08 05:10:23,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:10:23,351 INFO L231 Difference]: Finished difference. Result has 186 places, 180 transitions, 416 flow [2025-02-08 05:10:23,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=416, PETRI_PLACES=186, PETRI_TRANSITIONS=180} [2025-02-08 05:10:23,352 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-02-08 05:10:23,352 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 180 transitions, 416 flow [2025-02-08 05:10:23,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 0 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-08 05:10:23,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:23,353 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:23,359 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-08 05:10:23,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:23,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:10:23,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1438539357, now seen corresponding path program 2 times [2025-02-08 05:10:23,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553266796] [2025-02-08 05:10:23,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:10:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:23,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-08 05:10:23,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:10:23,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:10:23,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:10:23,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:23,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553266796] [2025-02-08 05:10:23,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553266796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:10:23,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229742316] [2025-02-08 05:10:23,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:10:23,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:23,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:23,675 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-08 05:10:23,676 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-08 05:10:23,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-02-08 05:10:23,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:10:23,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:10:23,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:23,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:10:23,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:10:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:10:23,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:10:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:10:23,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229742316] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:10:23,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:10:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-08 05:10:23,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061986702] [2025-02-08 05:10:23,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:10:23,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:10:23,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:23,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:10:23,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:10:23,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-02-08 05:10:23,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 180 transitions, 416 flow. Second operand has 15 states, 15 states have (on average 162.13333333333333) internal successors, (2432), 15 states have internal predecessors, (2432), 0 states have call successors, (0), 0 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-08 05:10:23,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:23,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-02-08 05:10:23,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:24,126 INFO L124 PetriNetUnfolderBase]: 33/543 cut-off events. [2025-02-08 05:10:24,126 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 05:10:24,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 543 events. 33/543 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1977 event pairs, 20 based on Foata normal form. 3/497 useless extension candidates. Maximal degree in co-relation 511. Up to 56 conditions per place. [2025-02-08 05:10:24,129 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 21 selfloop transitions, 18 changer transitions 0/194 dead transitions. [2025-02-08 05:10:24,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 194 transitions, 568 flow [2025-02-08 05:10:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 05:10:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-08 05:10:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2922 transitions. [2025-02-08 05:10:24,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8634751773049646 [2025-02-08 05:10:24,134 INFO L175 Difference]: Start difference. First operand has 186 places, 180 transitions, 416 flow. Second operand 18 states and 2922 transitions. [2025-02-08 05:10:24,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 194 transitions, 568 flow [2025-02-08 05:10:24,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 194 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-08 05:10:24,137 INFO L231 Difference]: Finished difference. Result has 206 places, 190 transitions, 516 flow [2025-02-08 05:10:24,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=516, PETRI_PLACES=206, PETRI_TRANSITIONS=190} [2025-02-08 05:10:24,137 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-02-08 05:10:24,137 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 190 transitions, 516 flow [2025-02-08 05:10:24,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 162.13333333333333) internal successors, (2432), 15 states have internal predecessors, (2432), 0 states have call successors, (0), 0 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-08 05:10:24,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:24,139 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:24,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:10:24,339 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,SelfDestructingSolverStorable8 [2025-02-08 05:10:24,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:10:24,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 919349720, now seen corresponding path program 3 times [2025-02-08 05:10:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857106107] [2025-02-08 05:10:24,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:10:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:24,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-02-08 05:10:24,387 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:10:24,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 05:10:24,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:24,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:24,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:10:24,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:10:24,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:24,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:24,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:24,423 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:24,423 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-02-08 05:10:24,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-02-08 05:10:24,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-02-08 05:10:24,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:10:24,424 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-08 05:10:24,425 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:24,425 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:10:24,449 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:24,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 256 transitions, 530 flow [2025-02-08 05:10:24,470 INFO L124 PetriNetUnfolderBase]: 16/281 cut-off events. [2025-02-08 05:10:24,470 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:10:24,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 281 events. 16/281 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 767 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 210. Up to 4 conditions per place. [2025-02-08 05:10:24,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 256 transitions, 530 flow [2025-02-08 05:10:24,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 256 transitions, 530 flow [2025-02-08 05:10:24,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:24,476 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;@79836e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:24,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-08 05:10:24,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:24,479 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-08 05:10:24,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:24,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:24,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:10:24,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:10:24,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1675454340, now seen corresponding path program 1 times [2025-02-08 05:10:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:24,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245645958] [2025-02-08 05:10:24,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:24,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:10:24,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:10:24,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:24,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:24,632 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-08 05:10:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:24,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245645958] [2025-02-08 05:10:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245645958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:10:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427805371] [2025-02-08 05:10:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:24,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:10:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:24,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:10:24,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:10:24,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 256 [2025-02-08 05:10:24,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 256 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 0 states have call successors, (0), 0 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-08 05:10:24,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:24,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 256 [2025-02-08 05:10:24,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:25,506 INFO L124 PetriNetUnfolderBase]: 1746/6791 cut-off events. [2025-02-08 05:10:25,506 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2025-02-08 05:10:25,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9602 conditions, 6791 events. 1746/6791 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 66911 event pairs, 1368 based on Foata normal form. 1463/7182 useless extension candidates. Maximal degree in co-relation 6429. Up to 2449 conditions per place. [2025-02-08 05:10:25,557 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 33 selfloop transitions, 5 changer transitions 0/236 dead transitions. [2025-02-08 05:10:25,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 236 transitions, 566 flow [2025-02-08 05:10:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:10:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:10:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1267 transitions. [2025-02-08 05:10:25,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8248697916666666 [2025-02-08 05:10:25,560 INFO L175 Difference]: Start difference. First operand has 247 places, 256 transitions, 530 flow. Second operand 6 states and 1267 transitions. [2025-02-08 05:10:25,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 236 transitions, 566 flow [2025-02-08 05:10:25,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 236 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:25,563 INFO L231 Difference]: Finished difference. Result has 241 places, 236 transitions, 498 flow [2025-02-08 05:10:25,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=241, PETRI_TRANSITIONS=236} [2025-02-08 05:10:25,564 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-02-08 05:10:25,564 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 236 transitions, 498 flow [2025-02-08 05:10:25,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.5) internal successors, (1227), 6 states have internal predecessors, (1227), 0 states have call successors, (0), 0 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-08 05:10:25,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:25,565 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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] [2025-02-08 05:10:25,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:10:25,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:10:25,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1922294798, now seen corresponding path program 1 times [2025-02-08 05:10:25,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000587840] [2025-02-08 05:10:25,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:25,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:25,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:10:25,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:10:25,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:25,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:25,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000587840] [2025-02-08 05:10:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000587840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:25,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:25,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:10:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549580620] [2025-02-08 05:10:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:25,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:25,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:25,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 256 [2025-02-08 05:10:25,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 236 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 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-08 05:10:25,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:25,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 256 [2025-02-08 05:10:25,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:25,871 INFO L124 PetriNetUnfolderBase]: 283/2409 cut-off events. [2025-02-08 05:10:25,872 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-02-08 05:10:25,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 2409 events. 283/2409 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19588 event pairs, 220 based on Foata normal form. 1/2155 useless extension candidates. Maximal degree in co-relation 2834. Up to 381 conditions per place. [2025-02-08 05:10:25,889 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 19 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2025-02-08 05:10:25,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 237 transitions, 544 flow [2025-02-08 05:10:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-02-08 05:10:25,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2025-02-08 05:10:25,891 INFO L175 Difference]: Start difference. First operand has 241 places, 236 transitions, 498 flow. Second operand 3 states and 688 transitions. [2025-02-08 05:10:25,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 237 transitions, 544 flow [2025-02-08 05:10:25,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 237 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:10:25,894 INFO L231 Difference]: Finished difference. Result has 239 places, 237 transitions, 500 flow [2025-02-08 05:10:25,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=239, PETRI_TRANSITIONS=237} [2025-02-08 05:10:25,895 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-02-08 05:10:25,895 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 237 transitions, 500 flow [2025-02-08 05:10:25,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 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-08 05:10:25,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:25,896 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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] [2025-02-08 05:10:25,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:10:25,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:10:25,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:25,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1419185719, now seen corresponding path program 1 times [2025-02-08 05:10:25,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:25,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717567363] [2025-02-08 05:10:25,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:25,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:10:25,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:10:25,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:25,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:25,939 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-08 05:10:25,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:25,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717567363] [2025-02-08 05:10:25,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717567363] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:10:25,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484299851] [2025-02-08 05:10:25,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:25,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:25,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:25,942 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-08 05:10:25,943 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-08 05:10:25,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:10:26,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:10:26,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:26,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:26,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:10:26,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:10:26,031 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-08 05:10:26,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:10:26,058 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-08 05:10:26,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484299851] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:10:26,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:10:26,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:10:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214748007] [2025-02-08 05:10:26,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:10:26,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:10:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:26,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:10:26,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:10:26,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-02-08 05:10:26,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 237 transitions, 500 flow. Second operand has 10 states, 10 states have (on average 221.1) internal successors, (2211), 10 states have internal predecessors, (2211), 0 states have call successors, (0), 0 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-08 05:10:26,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:26,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-02-08 05:10:26,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:26,417 INFO L124 PetriNetUnfolderBase]: 283/2424 cut-off events. [2025-02-08 05:10:26,417 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-02-08 05:10:26,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 2424 events. 283/2424 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19686 event pairs, 220 based on Foata normal form. 2/2171 useless extension candidates. Maximal degree in co-relation 2869. Up to 381 conditions per place. [2025-02-08 05:10:26,435 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 23 selfloop transitions, 9 changer transitions 0/245 dead transitions. [2025-02-08 05:10:26,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 245 transitions, 582 flow [2025-02-08 05:10:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:10:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:10:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2005 transitions. [2025-02-08 05:10:26,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702256944444444 [2025-02-08 05:10:26,438 INFO L175 Difference]: Start difference. First operand has 239 places, 237 transitions, 500 flow. Second operand 9 states and 2005 transitions. [2025-02-08 05:10:26,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 245 transitions, 582 flow [2025-02-08 05:10:26,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:10:26,442 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 548 flow [2025-02-08 05:10:26,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=548, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2025-02-08 05:10:26,442 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-02-08 05:10:26,443 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 548 flow [2025-02-08 05:10:26,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 221.1) internal successors, (2211), 10 states have internal predecessors, (2211), 0 states have call successors, (0), 0 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-08 05:10:26,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:26,443 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:10:26,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 05:10:26,644 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,SelfDestructingSolverStorable12 [2025-02-08 05:10:26,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:10:26,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1718004247, now seen corresponding path program 2 times [2025-02-08 05:10:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612759210] [2025-02-08 05:10:26,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:10:26,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:26,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-08 05:10:26,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:10:26,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:10:26,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:10:26,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612759210] [2025-02-08 05:10:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612759210] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:10:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008141387] [2025-02-08 05:10:26,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:10:26,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:26,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:26,747 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-08 05:10:26,749 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-08 05:10:26,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-02-08 05:10:26,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:10:26,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:10:26,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:26,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:10:26,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:10:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:10:26,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:10:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:10:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008141387] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:10:26,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:10:26,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-08 05:10:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733937016] [2025-02-08 05:10:26,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:10:26,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:10:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:26,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:10:26,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:10:27,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-02-08 05:10:27,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 548 flow. Second operand has 15 states, 15 states have (on average 221.2) internal successors, (3318), 15 states have internal predecessors, (3318), 0 states have call successors, (0), 0 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-08 05:10:27,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:27,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-02-08 05:10:27,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:27,575 INFO L124 PetriNetUnfolderBase]: 283/2463 cut-off events. [2025-02-08 05:10:27,575 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-02-08 05:10:27,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 2463 events. 283/2463 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 19683 event pairs, 220 based on Foata normal form. 3/2211 useless extension candidates. Maximal degree in co-relation 2831. Up to 381 conditions per place. [2025-02-08 05:10:27,609 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 26 selfloop transitions, 18 changer transitions 0/257 dead transitions. [2025-02-08 05:10:27,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 257 transitions, 710 flow [2025-02-08 05:10:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 05:10:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-08 05:10:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3989 transitions. [2025-02-08 05:10:27,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656684027777778 [2025-02-08 05:10:27,621 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 548 flow. Second operand 18 states and 3989 transitions. [2025-02-08 05:10:27,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 257 transitions, 710 flow [2025-02-08 05:10:27,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 257 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-08 05:10:27,629 INFO L231 Difference]: Finished difference. Result has 269 places, 253 transitions, 648 flow [2025-02-08 05:10:27,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=648, PETRI_PLACES=269, PETRI_TRANSITIONS=253} [2025-02-08 05:10:27,631 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-02-08 05:10:27,631 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 253 transitions, 648 flow [2025-02-08 05:10:27,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 221.2) internal successors, (3318), 15 states have internal predecessors, (3318), 0 states have call successors, (0), 0 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-08 05:10:27,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:27,633 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 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] [2025-02-08 05:10:27,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 05:10:27,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-08 05:10:27,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-02-08 05:10:27,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash -82039726, now seen corresponding path program 3 times [2025-02-08 05:10:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:27,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709224632] [2025-02-08 05:10:27,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:10:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:27,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 8 equivalence classes. [2025-02-08 05:10:27,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:10:27,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 05:10:27,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:27,902 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:27,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:10:27,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:10:27,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:27,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:27,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:27,937 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-08 05:10:27,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-08 05:10:27,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-08 05:10:27,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-08 05:10:27,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-08 05:10:27,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-08 05:10:27,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-08 05:10:27,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-08 05:10:27,938 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-08 05:10:27,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:10:27,938 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-08 05:10:27,938 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:27,938 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:10:27,973 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:27,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 324 transitions, 676 flow [2025-02-08 05:10:28,022 INFO L124 PetriNetUnfolderBase]: 21/358 cut-off events. [2025-02-08 05:10:28,023 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:10:28,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 358 events. 21/358 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1175 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 289. Up to 5 conditions per place. [2025-02-08 05:10:28,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 324 transitions, 676 flow [2025-02-08 05:10:28,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 324 transitions, 676 flow [2025-02-08 05:10:28,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:28,030 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;@79836e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:28,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 05:10:28,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:28,033 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-08 05:10:28,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:28,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:28,033 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] [2025-02-08 05:10:28,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:10:28,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1348925760, now seen corresponding path program 1 times [2025-02-08 05:10:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029613039] [2025-02-08 05:10:28,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:28,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:10:28,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:10:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:28,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:28,175 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-08 05:10:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:28,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029613039] [2025-02-08 05:10:28,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029613039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:28,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:10:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998846546] [2025-02-08 05:10:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:28,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:10:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:28,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:10:28,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:10:28,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 324 [2025-02-08 05:10:28,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 324 transitions, 676 flow. Second operand has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 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-08 05:10:28,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:28,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 324 [2025-02-08 05:10:28,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:35,245 INFO L124 PetriNetUnfolderBase]: 23093/67604 cut-off events. [2025-02-08 05:10:35,245 INFO L125 PetriNetUnfolderBase]: For 7852/7852 co-relation queries the response was YES. [2025-02-08 05:10:35,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101026 conditions, 67604 events. 23093/67604 cut-off events. For 7852/7852 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 896465 event pairs, 18864 based on Foata normal form. 15545/73239 useless extension candidates. Maximal degree in co-relation 60573. Up to 29414 conditions per place. [2025-02-08 05:10:36,019 INFO L140 encePairwiseOnDemand]: 305/324 looper letters, 42 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-02-08 05:10:36,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 720 flow [2025-02-08 05:10:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:10:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:10:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1609 transitions. [2025-02-08 05:10:36,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8276748971193416 [2025-02-08 05:10:36,021 INFO L175 Difference]: Start difference. First operand has 312 places, 324 transitions, 676 flow. Second operand 6 states and 1609 transitions. [2025-02-08 05:10:36,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 720 flow [2025-02-08 05:10:36,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 299 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:36,027 INFO L231 Difference]: Finished difference. Result has 304 places, 299 transitions, 630 flow [2025-02-08 05:10:36,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=304, PETRI_TRANSITIONS=299} [2025-02-08 05:10:36,029 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-02-08 05:10:36,029 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 299 transitions, 630 flow [2025-02-08 05:10:36,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 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-08 05:10:36,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:36,030 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:36,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:10:36,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:10:36,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1685099443, now seen corresponding path program 1 times [2025-02-08 05:10:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538902139] [2025-02-08 05:10:36,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:36,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:10:36,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:10:36,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:36,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:36,056 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-08 05:10:36,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:36,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538902139] [2025-02-08 05:10:36,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538902139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:36,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:36,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:10:36,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349681761] [2025-02-08 05:10:36,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:36,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:36,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:36,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:36,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:36,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 324 [2025-02-08 05:10:36,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 299 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 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-08 05:10:36,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:36,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 324 [2025-02-08 05:10:36,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:37,385 INFO L124 PetriNetUnfolderBase]: 2033/12509 cut-off events. [2025-02-08 05:10:37,385 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-02-08 05:10:37,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15499 conditions, 12509 events. 2033/12509 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 147844 event pairs, 1720 based on Foata normal form. 1/11224 useless extension candidates. Maximal degree in co-relation 15434. Up to 2506 conditions per place. [2025-02-08 05:10:37,540 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 24 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-02-08 05:10:37,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 300 transitions, 686 flow [2025-02-08 05:10:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2025-02-08 05:10:37,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8950617283950617 [2025-02-08 05:10:37,542 INFO L175 Difference]: Start difference. First operand has 304 places, 299 transitions, 630 flow. Second operand 3 states and 870 transitions. [2025-02-08 05:10:37,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 300 transitions, 686 flow [2025-02-08 05:10:37,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 300 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:10:37,548 INFO L231 Difference]: Finished difference. Result has 302 places, 300 transitions, 632 flow [2025-02-08 05:10:37,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=302, PETRI_TRANSITIONS=300} [2025-02-08 05:10:37,549 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-02-08 05:10:37,549 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 300 transitions, 632 flow [2025-02-08 05:10:37,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 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-08 05:10:37,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:37,550 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:37,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:10:37,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:10:37,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1519890556, now seen corresponding path program 1 times [2025-02-08 05:10:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953452560] [2025-02-08 05:10:37,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:37,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:10:37,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:10:37,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:37,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:37,593 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-08 05:10:37,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:37,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953452560] [2025-02-08 05:10:37,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953452560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:10:37,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583898378] [2025-02-08 05:10:37,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:37,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:37,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:37,597 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:10:37,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 05:10:37,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:10:37,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:10:37,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:37,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:37,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:10:37,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:10:37,704 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-08 05:10:37,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:10:37,733 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-08 05:10:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583898378] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:10:37,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:10:37,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:10:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149642554] [2025-02-08 05:10:37,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:10:37,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:10:37,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:37,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:10:37,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:10:37,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-02-08 05:10:37,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 300 transitions, 632 flow. Second operand has 10 states, 10 states have (on average 280.2) internal successors, (2802), 10 states have internal predecessors, (2802), 0 states have call successors, (0), 0 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-08 05:10:37,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:37,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-02-08 05:10:37,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:39,235 INFO L124 PetriNetUnfolderBase]: 2033/12524 cut-off events. [2025-02-08 05:10:39,235 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-02-08 05:10:39,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15522 conditions, 12524 events. 2033/12524 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 147314 event pairs, 1720 based on Foata normal form. 2/11240 useless extension candidates. Maximal degree in co-relation 15469. Up to 2506 conditions per place. [2025-02-08 05:10:39,400 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 28 selfloop transitions, 9 changer transitions 0/308 dead transitions. [2025-02-08 05:10:39,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 308 transitions, 724 flow [2025-02-08 05:10:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:10:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:10:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2541 transitions. [2025-02-08 05:10:39,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8713991769547325 [2025-02-08 05:10:39,404 INFO L175 Difference]: Start difference. First operand has 302 places, 300 transitions, 632 flow. Second operand 9 states and 2541 transitions. [2025-02-08 05:10:39,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 308 transitions, 724 flow [2025-02-08 05:10:39,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:10:39,411 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 680 flow [2025-02-08 05:10:39,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=680, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-02-08 05:10:39,412 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 0 predicate places. [2025-02-08 05:10:39,412 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 680 flow [2025-02-08 05:10:39,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 280.2) internal successors, (2802), 10 states have internal predecessors, (2802), 0 states have call successors, (0), 0 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-08 05:10:39,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:39,413 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-08 05:10:39,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 05:10:39,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:39,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:10:39,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1457759708, now seen corresponding path program 2 times [2025-02-08 05:10:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:39,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573002213] [2025-02-08 05:10:39,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:10:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:39,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-08 05:10:39,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:10:39,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:10:39,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:10:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573002213] [2025-02-08 05:10:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573002213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:10:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918517418] [2025-02-08 05:10:39,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:10:39,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:39,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:39,736 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:10:39,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 05:10:39,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-08 05:10:39,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:10:39,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:10:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:39,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:10:39,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:10:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:10:39,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:10:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:10:39,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918517418] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:10:39,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:10:39,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-08 05:10:39,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730880166] [2025-02-08 05:10:39,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:10:39,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:10:39,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:39,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:10:39,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:10:40,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-02-08 05:10:40,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 680 flow. Second operand has 15 states, 15 states have (on average 280.26666666666665) internal successors, (4204), 15 states have internal predecessors, (4204), 0 states have call successors, (0), 0 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-08 05:10:40,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:40,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-02-08 05:10:40,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:42,181 INFO L124 PetriNetUnfolderBase]: 2033/12563 cut-off events. [2025-02-08 05:10:42,182 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-02-08 05:10:42,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15615 conditions, 12563 events. 2033/12563 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 147784 event pairs, 1720 based on Foata normal form. 3/11280 useless extension candidates. Maximal degree in co-relation 15431. Up to 2506 conditions per place. [2025-02-08 05:10:42,494 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 31 selfloop transitions, 18 changer transitions 0/320 dead transitions. [2025-02-08 05:10:42,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 320 transitions, 852 flow [2025-02-08 05:10:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 05:10:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-08 05:10:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5056 transitions. [2025-02-08 05:10:42,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669410150891632 [2025-02-08 05:10:42,499 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 680 flow. Second operand 18 states and 5056 transitions. [2025-02-08 05:10:42,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 320 transitions, 852 flow [2025-02-08 05:10:42,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 320 transitions, 840 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-08 05:10:42,506 INFO L231 Difference]: Finished difference. Result has 332 places, 316 transitions, 780 flow [2025-02-08 05:10:42,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=780, PETRI_PLACES=332, PETRI_TRANSITIONS=316} [2025-02-08 05:10:42,507 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 20 predicate places. [2025-02-08 05:10:42,507 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 316 transitions, 780 flow [2025-02-08 05:10:42,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 280.26666666666665) internal successors, (4204), 15 states have internal predecessors, (4204), 0 states have call successors, (0), 0 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-08 05:10:42,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:42,508 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:10:42,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 05:10:42,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:10:42,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-02-08 05:10:42,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:42,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1741416339, now seen corresponding path program 3 times [2025-02-08 05:10:42,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:42,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35701324] [2025-02-08 05:10:42,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:10:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:42,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-02-08 05:10:42,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:10:42,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 05:10:42,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:42,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:42,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:10:42,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:10:42,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:42,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:42,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:42,778 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:42,778 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-02-08 05:10:42,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-02-08 05:10:42,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-02-08 05:10:42,779 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-02-08 05:10:42,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-02-08 05:10:42,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-02-08 05:10:42,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-02-08 05:10:42,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-02-08 05:10:42,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-02-08 05:10:42,780 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-02-08 05:10:42,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:10:42,780 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-02-08 05:10:42,781 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:42,781 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-08 05:10:42,824 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:42,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 392 transitions, 824 flow [2025-02-08 05:10:42,869 INFO L124 PetriNetUnfolderBase]: 26/435 cut-off events. [2025-02-08 05:10:42,869 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 05:10:42,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 435 events. 26/435 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1598 event pairs, 0 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 371. Up to 6 conditions per place. [2025-02-08 05:10:42,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 392 transitions, 824 flow [2025-02-08 05:10:42,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 392 transitions, 824 flow [2025-02-08 05:10:42,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:42,881 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;@79836e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:42,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-02-08 05:10:42,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:42,883 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-02-08 05:10:42,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:42,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:42,883 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] [2025-02-08 05:10:42,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:10:42,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1349376456, now seen corresponding path program 1 times [2025-02-08 05:10:42,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:42,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685645479] [2025-02-08 05:10:42,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:42,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:42,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:10:42,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:10:42,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:42,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:43,001 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-08 05:10:43,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:43,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685645479] [2025-02-08 05:10:43,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685645479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:43,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:43,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:10:43,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033928041] [2025-02-08 05:10:43,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:43,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:10:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:43,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:10:43,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:10:43,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 392 [2025-02-08 05:10:43,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 392 transitions, 824 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 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-08 05:10:43,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:43,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 392 [2025-02-08 05:10:43,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand