./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:24:54,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:24:54,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:24:54,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:24:54,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:24:54,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:24:54,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:24:54,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:24:54,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:24:54,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:24:54,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:24:54,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:24:54,711 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:24:54,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:24:54,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:24:54,711 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:24:54,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:24:54,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:24:54,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:24:54,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:24:54,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:24:54,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:24:54,713 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:24:54,713 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:24:54,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:24:54,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:24:54,713 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:24:54,713 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:24:54,713 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:24:54,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:24:54,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:24:54,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:24:54,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:24:54,714 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ce2a912f26c96a7a9e9698d6a341c03f1dcacccb179d06c2396dd9f137bcbd1 [2025-03-04 06:24:54,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:24:54,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:24:54,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:24:54,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:24:54,944 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:24:54,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-04 06:24:56,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701a60b3c/f1ffd9ef6f954dca8be2c1bda215d9b0/FLAGaeb9734a7 [2025-03-04 06:24:56,311 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:24:56,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2025-03-04 06:24:56,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701a60b3c/f1ffd9ef6f954dca8be2c1bda215d9b0/FLAGaeb9734a7 [2025-03-04 06:24:56,333 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701a60b3c/f1ffd9ef6f954dca8be2c1bda215d9b0 [2025-03-04 06:24:56,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:24:56,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:24:56,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:24:56,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:24:56,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:24:56,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6bc5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56, skipping insertion in model container [2025-03-04 06:24:56,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:24:56,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:24:56,563 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:24:56,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:24:56,619 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:24:56,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56 WrapperNode [2025-03-04 06:24:56,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:24:56,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:24:56,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:24:56,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:24:56,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,646 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 103 [2025-03-04 06:24:56,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:24:56,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:24:56,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:24:56,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:24:56,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,669 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:24:56,673 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:24:56,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:24:56,674 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:24:56,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (1/1) ... [2025-03-04 06:24:56,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:24:56,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:56,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:24:56,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:24:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:24:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 06:24:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 06:24:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:24:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:24:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:24:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:24:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:24:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:24:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:24:56,716 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:24:56,804 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:24:56,806 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:24:56,962 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:24:56,962 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:24:56,975 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:24:56,975 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:24:56,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:24:56 BoogieIcfgContainer [2025-03-04 06:24:56,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:24:56,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:24:56,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:24:56,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:24:56,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:24:56" (1/3) ... [2025-03-04 06:24:56,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a48de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:24:56, skipping insertion in model container [2025-03-04 06:24:56,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:24:56" (2/3) ... [2025-03-04 06:24:56,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a48de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:24:56, skipping insertion in model container [2025-03-04 06:24:56,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:24:56" (3/3) ... [2025-03-04 06:24:56,982 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2025-03-04 06:24:56,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:24:56,993 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-03-04 06:24:56,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:24:57,055 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:57,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 120 transitions, 244 flow [2025-03-04 06:24:57,120 INFO L124 PetriNetUnfolderBase]: 6/127 cut-off events. [2025-03-04 06:24:57,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:57,125 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 136 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-03-04 06:24:57,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 120 transitions, 244 flow [2025-03-04 06:24:57,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 120 transitions, 244 flow [2025-03-04 06:24:57,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:57,140 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;@1404c8ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:57,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 06:24:57,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:57,151 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:24:57,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:57,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:57,152 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-03-04 06:24:57,152 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-03-04 06:24:57,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:57,156 INFO L85 PathProgramCache]: Analyzing trace with hash -280794531, now seen corresponding path program 1 times [2025-03-04 06:24:57,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:57,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943832813] [2025-03-04 06:24:57,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:57,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:57,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:24:57,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:24:57,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:57,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943832813] [2025-03-04 06:24:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943832813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:57,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:24:57,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595683768] [2025-03-04 06:24:57,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:57,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:24:57,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:57,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:24:57,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:24:57,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2025-03-04 06:24:57,942 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-03-04 06:24:57,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:57,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2025-03-04 06:24:57,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:57,996 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2025-03-04 06:24:57,997 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:24:57,997 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 82 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-03-04 06:24:57,998 INFO L140 encePairwiseOnDemand]: 110/120 looper letters, 15 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-04 06:24:57,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 110 transitions, 264 flow [2025-03-04 06:24:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:24:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:24:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2025-03-04 06:24:58,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-03-04 06:24:58,014 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 244 flow. Second operand 6 states and 583 transitions. [2025-03-04 06:24:58,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 110 transitions, 264 flow [2025-03-04 06:24:58,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 110 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:24:58,021 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 234 flow [2025-03-04 06:24:58,024 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-03-04 06:24:58,028 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-03-04 06:24:58,029 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 234 flow [2025-03-04 06:24:58,029 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-03-04 06:24:58,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:58,030 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-03-04 06:24:58,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:24:58,030 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-03-04 06:24:58,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash -714229618, now seen corresponding path program 1 times [2025-03-04 06:24:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:58,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515808502] [2025-03-04 06:24:58,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:58,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 06:24:58,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 06:24:58,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:58,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:58,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515808502] [2025-03-04 06:24:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515808502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:58,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:58,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:24:58,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62155505] [2025-03-04 06:24:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:58,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:24:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:58,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:24:58,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:24:58,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 120 [2025-03-04 06:24:58,110 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-03-04 06:24:58,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:58,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 120 [2025-03-04 06:24:58,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:58,147 INFO L124 PetriNetUnfolderBase]: 3/125 cut-off events. [2025-03-04 06:24:58,147 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:24:58,147 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 78 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-03-04 06:24:58,148 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 9 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-04 06:24:58,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 260 flow [2025-03-04 06:24:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:24:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:24:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-03-04 06:24:58,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-03-04 06:24:58,151 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 234 flow. Second operand 3 states and 324 transitions. [2025-03-04 06:24:58,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 260 flow [2025-03-04 06:24:58,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 111 transitions, 248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:24:58,154 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 236 flow [2025-03-04 06:24:58,155 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-03-04 06:24:58,156 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -4 predicate places. [2025-03-04 06:24:58,156 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 236 flow [2025-03-04 06:24:58,156 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-03-04 06:24:58,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:58,156 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-03-04 06:24:58,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:24:58,157 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-03-04 06:24:58,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:58,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1376890318, now seen corresponding path program 1 times [2025-03-04 06:24:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:58,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240453639] [2025-03-04 06:24:58,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:58,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:24:58,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:24:58,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:58,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:58,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:58,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240453639] [2025-03-04 06:24:58,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240453639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:58,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179897100] [2025-03-04 06:24:58,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:58,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:58,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:58,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:24:58,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:24:58,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:24:58,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:24:58,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:58,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:58,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:24:58,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:58,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179897100] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:58,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:24:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621629141] [2025-03-04 06:24:58,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:58,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:24:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:58,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:24:58,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:24:58,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-03-04 06:24:58,515 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-03-04 06:24:58,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:58,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-03-04 06:24:58,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:58,603 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2025-03-04 06:24:58,603 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:24:58,604 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 50 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-03-04 06:24:58,604 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 13 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2025-03-04 06:24:58,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 298 flow [2025-03-04 06:24:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:24:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:24:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 933 transitions. [2025-03-04 06:24:58,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8638888888888889 [2025-03-04 06:24:58,608 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 236 flow. Second operand 9 states and 933 transitions. [2025-03-04 06:24:58,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 298 flow [2025-03-04 06:24:58,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 119 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:58,612 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 284 flow [2025-03-04 06:24:58,612 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-03-04 06:24:58,612 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2025-03-04 06:24:58,612 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 284 flow [2025-03-04 06:24:58,613 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-03-04 06:24:58,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:58,613 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-03-04 06:24:58,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:58,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:58,818 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-03-04 06:24:58,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1215666098, now seen corresponding path program 2 times [2025-03-04 06:24:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:58,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577455243] [2025-03-04 06:24:58,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:58,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:58,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-04 06:24:58,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:24:58,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:58,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:58,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577455243] [2025-03-04 06:24:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577455243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:24:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603995867] [2025-03-04 06:24:58,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:24:58,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:24:58,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:24:58,982 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:24:58,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:24:59,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-04 06:24:59,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:24:59,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:24:59,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:59,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:24:59,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:24:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:59,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:24:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:24:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603995867] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:24:59,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:24:59,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:24:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266187450] [2025-03-04 06:24:59,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:24:59,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:24:59,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:59,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:24:59,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:24:59,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 120 [2025-03-04 06:24:59,372 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-03-04 06:24:59,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:59,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 120 [2025-03-04 06:24:59,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:59,518 INFO L124 PetriNetUnfolderBase]: 3/179 cut-off events. [2025-03-04 06:24:59,519 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 06:24:59,519 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 51 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-03-04 06:24:59,520 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 16 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2025-03-04 06:24:59,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 131 transitions, 426 flow [2025-03-04 06:24:59,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:24:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:24:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1855 transitions. [2025-03-04 06:24:59,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8587962962962963 [2025-03-04 06:24:59,524 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 284 flow. Second operand 18 states and 1855 transitions. [2025-03-04 06:24:59,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 131 transitions, 426 flow [2025-03-04 06:24:59,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 131 transitions, 414 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:24:59,527 INFO L231 Difference]: Finished difference. Result has 143 places, 127 transitions, 384 flow [2025-03-04 06:24:59,527 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-03-04 06:24:59,528 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2025-03-04 06:24:59,528 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 127 transitions, 384 flow [2025-03-04 06:24:59,529 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-03-04 06:24:59,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:59,529 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-03-04 06:24:59,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:24:59,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 06:24:59,730 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-03-04 06:24:59,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1620490254, now seen corresponding path program 3 times [2025-03-04 06:24:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995221900] [2025-03-04 06:24:59,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:24:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:59,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 7 equivalence classes. [2025-03-04 06:24:59,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:24:59,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 06:24:59,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:59,783 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:24:59,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:24:59,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:24:59,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:59,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:24:59,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:24:59,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:24:59,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 06:24:59,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-04 06:24:59,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-04 06:24:59,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-04 06:24:59,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-04 06:24:59,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-04 06:24:59,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-04 06:24:59,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-04 06:24:59,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-04 06:24:59,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-04 06:24:59,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:24:59,832 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:24:59,835 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:24:59,836 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:24:59,874 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:24:59,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 188 transitions, 386 flow [2025-03-04 06:24:59,895 INFO L124 PetriNetUnfolderBase]: 11/204 cut-off events. [2025-03-04 06:24:59,895 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:24:59,896 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-03-04 06:24:59,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 188 transitions, 386 flow [2025-03-04 06:24:59,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 188 transitions, 386 flow [2025-03-04 06:24:59,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:24:59,899 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;@1404c8ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:24:59,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 06:24:59,903 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:24:59,903 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:24:59,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:24:59,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:59,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:59,903 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-03-04 06:24:59,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash 201509785, now seen corresponding path program 1 times [2025-03-04 06:24:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:59,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504863860] [2025-03-04 06:24:59,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:59,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:24:59,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:24:59,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:00,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:00,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504863860] [2025-03-04 06:25:00,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504863860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:00,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:00,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:25:00,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889160720] [2025-03-04 06:25:00,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:00,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:25:00,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:00,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:25:00,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:00,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 188 [2025-03-04 06:25:00,232 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-03-04 06:25:00,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:00,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 188 [2025-03-04 06:25:00,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:00,345 INFO L124 PetriNetUnfolderBase]: 104/725 cut-off events. [2025-03-04 06:25:00,345 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:25:00,348 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-03-04 06:25:00,351 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 24 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2025-03-04 06:25:00,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 414 flow [2025-03-04 06:25:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:25:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:25:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 925 transitions. [2025-03-04 06:25:00,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200354609929078 [2025-03-04 06:25:00,353 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 386 flow. Second operand 6 states and 925 transitions. [2025-03-04 06:25:00,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 414 flow [2025-03-04 06:25:00,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 173 transitions, 414 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:25:00,356 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 366 flow [2025-03-04 06:25:00,356 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-03-04 06:25:00,357 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -4 predicate places. [2025-03-04 06:25:00,357 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 366 flow [2025-03-04 06:25:00,358 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-03-04 06:25:00,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:00,358 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-03-04 06:25:00,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:25:00,358 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-03-04 06:25:00,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:00,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1506341509, now seen corresponding path program 1 times [2025-03-04 06:25:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:00,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794944966] [2025-03-04 06:25:00,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:00,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:00,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:25:00,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:25:00,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:00,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:00,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794944966] [2025-03-04 06:25:00,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794944966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:00,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:00,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:25:00,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556587258] [2025-03-04 06:25:00,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:00,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:25:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:00,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:25:00,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:25:00,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 188 [2025-03-04 06:25:00,412 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-03-04 06:25:00,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:00,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 188 [2025-03-04 06:25:00,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:00,491 INFO L124 PetriNetUnfolderBase]: 33/489 cut-off events. [2025-03-04 06:25:00,492 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 06:25:00,493 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 2027 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-03-04 06:25:00,494 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2025-03-04 06:25:00,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 174 transitions, 402 flow [2025-03-04 06:25:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:25:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:25:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-03-04 06:25:00,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-03-04 06:25:00,496 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 366 flow. Second operand 3 states and 506 transitions. [2025-03-04 06:25:00,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 174 transitions, 402 flow [2025-03-04 06:25:00,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 174 transitions, 390 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:25:00,498 INFO L231 Difference]: Finished difference. Result has 176 places, 174 transitions, 368 flow [2025-03-04 06:25:00,499 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-03-04 06:25:00,500 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, -6 predicate places. [2025-03-04 06:25:00,500 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 174 transitions, 368 flow [2025-03-04 06:25:00,500 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-03-04 06:25:00,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:00,500 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-03-04 06:25:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:25:00,500 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-03-04 06:25:00,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash -398308635, now seen corresponding path program 1 times [2025-03-04 06:25:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112861101] [2025-03-04 06:25:00,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:00,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:25:00,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:25:00,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:00,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:00,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:00,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112861101] [2025-03-04 06:25:00,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112861101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:00,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965203203] [2025-03-04 06:25:00,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:00,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:00,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:00,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:25:00,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:25:00,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:25:00,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:25:00,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:00,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:00,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:25:00,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:00,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:00,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965203203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:00,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:00,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:25:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663582525] [2025-03-04 06:25:00,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:00,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:25:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:00,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:25:00,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:25:00,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-04 06:25:00,737 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-03-04 06:25:00,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:00,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-04 06:25:00,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:00,823 INFO L124 PetriNetUnfolderBase]: 33/504 cut-off events. [2025-03-04 06:25:00,823 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 06:25:00,824 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 1998 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-03-04 06:25:00,826 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 18 selfloop transitions, 9 changer transitions 0/182 dead transitions. [2025-03-04 06:25:00,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 440 flow [2025-03-04 06:25:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:25:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:25:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1469 transitions. [2025-03-04 06:25:00,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8682033096926713 [2025-03-04 06:25:00,828 INFO L175 Difference]: Start difference. First operand has 176 places, 174 transitions, 368 flow. Second operand 9 states and 1469 transitions. [2025-03-04 06:25:00,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 440 flow [2025-03-04 06:25:00,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 438 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:00,831 INFO L231 Difference]: Finished difference. Result has 186 places, 180 transitions, 416 flow [2025-03-04 06:25:00,832 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-03-04 06:25:00,833 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-03-04 06:25:00,833 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 180 transitions, 416 flow [2025-03-04 06:25:00,834 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-03-04 06:25:00,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:00,834 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-03-04 06:25:00,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:25:01,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:01,038 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-03-04 06:25:01,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1404752155, now seen corresponding path program 2 times [2025-03-04 06:25:01,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:01,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871072870] [2025-03-04 06:25:01,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:01,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:01,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 06:25:01,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:25:01,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:01,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:25:01,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:01,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871072870] [2025-03-04 06:25:01,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871072870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:01,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344914493] [2025-03-04 06:25:01,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:01,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:01,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:01,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:25:01,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:25:01,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 06:25:01,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:25:01,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:01,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:01,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:25:01,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:25:01,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:25:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344914493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:01,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:01,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:25:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466773052] [2025-03-04 06:25:01,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:01,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:25:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:01,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:25:01,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:25:01,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-04 06:25:01,480 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-03-04 06:25:01,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:01,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-04 06:25:01,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:01,661 INFO L124 PetriNetUnfolderBase]: 33/543 cut-off events. [2025-03-04 06:25:01,661 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 06:25:01,663 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 1972 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-03-04 06:25:01,665 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 21 selfloop transitions, 18 changer transitions 0/194 dead transitions. [2025-03-04 06:25:01,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 194 transitions, 568 flow [2025-03-04 06:25:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:25:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:25:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2922 transitions. [2025-03-04 06:25:01,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8634751773049646 [2025-03-04 06:25:01,670 INFO L175 Difference]: Start difference. First operand has 186 places, 180 transitions, 416 flow. Second operand 18 states and 2922 transitions. [2025-03-04 06:25:01,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 194 transitions, 568 flow [2025-03-04 06:25:01,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 194 transitions, 556 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:01,672 INFO L231 Difference]: Finished difference. Result has 206 places, 190 transitions, 516 flow [2025-03-04 06:25:01,673 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-03-04 06:25:01,673 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 24 predicate places. [2025-03-04 06:25:01,673 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 190 transitions, 516 flow [2025-03-04 06:25:01,674 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-03-04 06:25:01,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:01,674 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-03-04 06:25:01,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 06:25:01,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:01,879 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-03-04 06:25:01,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1979172485, now seen corresponding path program 3 times [2025-03-04 06:25:01,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:01,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001064428] [2025-03-04 06:25:01,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:25:01,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:01,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-04 06:25:01,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:25:01,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 06:25:01,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:01,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:25:01,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:25:01,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:25:01,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:01,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:01,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:25:01,947 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:25:01,947 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-04 06:25:01,948 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-04 06:25:01,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:25:01,948 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:25:01,949 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:25:01,949 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:25:01,980 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:25:01,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 256 transitions, 530 flow [2025-03-04 06:25:02,003 INFO L124 PetriNetUnfolderBase]: 16/281 cut-off events. [2025-03-04 06:25:02,003 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:25:02,005 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 762 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-03-04 06:25:02,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 256 transitions, 530 flow [2025-03-04 06:25:02,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 256 transitions, 530 flow [2025-03-04 06:25:02,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:25:02,009 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;@1404c8ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:25:02,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 06:25:02,012 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:25:02,012 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:25:02,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:25:02,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:02,012 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-03-04 06:25:02,012 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-03-04 06:25:02,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1954851993, now seen corresponding path program 1 times [2025-03-04 06:25:02,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:02,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586170130] [2025-03-04 06:25:02,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:02,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:02,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:25:02,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:25:02,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:02,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:02,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586170130] [2025-03-04 06:25:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586170130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:02,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:02,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:25:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522862147] [2025-03-04 06:25:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:02,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:25:02,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:02,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:25:02,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:02,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 256 [2025-03-04 06:25:02,327 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-03-04 06:25:02,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:02,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 256 [2025-03-04 06:25:02,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:03,090 INFO L124 PetriNetUnfolderBase]: 1746/6791 cut-off events. [2025-03-04 06:25:03,090 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2025-03-04 06:25:03,108 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 67121 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-03-04 06:25:03,141 INFO L140 encePairwiseOnDemand]: 240/256 looper letters, 33 selfloop transitions, 5 changer transitions 0/236 dead transitions. [2025-03-04 06:25:03,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 236 transitions, 566 flow [2025-03-04 06:25:03,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:25:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:25:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1267 transitions. [2025-03-04 06:25:03,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8248697916666666 [2025-03-04 06:25:03,144 INFO L175 Difference]: Start difference. First operand has 247 places, 256 transitions, 530 flow. Second operand 6 states and 1267 transitions. [2025-03-04 06:25:03,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 236 transitions, 566 flow [2025-03-04 06:25:03,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 236 transitions, 564 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:25:03,148 INFO L231 Difference]: Finished difference. Result has 241 places, 236 transitions, 498 flow [2025-03-04 06:25:03,148 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-03-04 06:25:03,149 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-03-04 06:25:03,149 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 236 transitions, 498 flow [2025-03-04 06:25:03,149 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-03-04 06:25:03,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:03,150 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-03-04 06:25:03,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:25:03,150 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-03-04 06:25:03,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:03,150 INFO L85 PathProgramCache]: Analyzing trace with hash -462206525, now seen corresponding path program 1 times [2025-03-04 06:25:03,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:03,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132481005] [2025-03-04 06:25:03,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:03,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:03,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:25:03,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:25:03,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:03,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:03,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:03,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132481005] [2025-03-04 06:25:03,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132481005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:03,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:03,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:25:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832665717] [2025-03-04 06:25:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:03,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:25:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:03,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:25:03,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:25:03,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 256 [2025-03-04 06:25:03,197 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-03-04 06:25:03,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:03,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 256 [2025-03-04 06:25:03,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:03,452 INFO L124 PetriNetUnfolderBase]: 283/2409 cut-off events. [2025-03-04 06:25:03,452 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-04 06:25:03,464 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 19674 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-03-04 06:25:03,476 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 19 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2025-03-04 06:25:03,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 237 transitions, 544 flow [2025-03-04 06:25:03,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:25:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:25:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-03-04 06:25:03,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958333333333334 [2025-03-04 06:25:03,480 INFO L175 Difference]: Start difference. First operand has 241 places, 236 transitions, 498 flow. Second operand 3 states and 688 transitions. [2025-03-04 06:25:03,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 237 transitions, 544 flow [2025-03-04 06:25:03,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 237 transitions, 532 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:25:03,484 INFO L231 Difference]: Finished difference. Result has 239 places, 237 transitions, 500 flow [2025-03-04 06:25:03,485 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-03-04 06:25:03,486 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, -8 predicate places. [2025-03-04 06:25:03,486 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 237 transitions, 500 flow [2025-03-04 06:25:03,487 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-03-04 06:25:03,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:03,487 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-03-04 06:25:03,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:25:03,487 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-03-04 06:25:03,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:03,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1312957661, now seen corresponding path program 1 times [2025-03-04 06:25:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:03,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514486178] [2025-03-04 06:25:03,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:03,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:25:03,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:25:03,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:03,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:03,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:03,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514486178] [2025-03-04 06:25:03,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514486178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:03,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556839245] [2025-03-04 06:25:03,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:03,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:03,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:03,556 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:25:03,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 06:25:03,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:25:03,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:25:03,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:03,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:03,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:25:03,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:03,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:03,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556839245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:03,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:03,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:25:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706263069] [2025-03-04 06:25:03,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:03,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:25:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:03,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:25:03,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:25:03,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-03-04 06:25:03,742 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-03-04 06:25:03,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:03,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-03-04 06:25:03,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:04,045 INFO L124 PetriNetUnfolderBase]: 283/2424 cut-off events. [2025-03-04 06:25:04,046 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-03-04 06:25:04,065 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 19658 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-03-04 06:25:04,074 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 23 selfloop transitions, 9 changer transitions 0/245 dead transitions. [2025-03-04 06:25:04,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 245 transitions, 582 flow [2025-03-04 06:25:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:25:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:25:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2005 transitions. [2025-03-04 06:25:04,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702256944444444 [2025-03-04 06:25:04,078 INFO L175 Difference]: Start difference. First operand has 239 places, 237 transitions, 500 flow. Second operand 9 states and 2005 transitions. [2025-03-04 06:25:04,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 245 transitions, 582 flow [2025-03-04 06:25:04,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:04,083 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 548 flow [2025-03-04 06:25:04,084 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-03-04 06:25:04,084 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 2 predicate places. [2025-03-04 06:25:04,084 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 548 flow [2025-03-04 06:25:04,085 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-03-04 06:25:04,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:04,085 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-03-04 06:25:04,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 06:25:04,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 06:25:04,286 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-03-04 06:25:04,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1824530211, now seen corresponding path program 2 times [2025-03-04 06:25:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062620768] [2025-03-04 06:25:04,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:04,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 06:25:04,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:25:04,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:04,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:25:04,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:04,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062620768] [2025-03-04 06:25:04,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062620768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:04,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688495837] [2025-03-04 06:25:04,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:04,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:04,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:04,387 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:25:04,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 06:25:04,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 06:25:04,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:25:04,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:04,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:04,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:25:04,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:25:04,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:04,613 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:25:04,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688495837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:04,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:04,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:25:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366811310] [2025-03-04 06:25:04,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:04,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:25:04,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:04,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:25:04,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:25:04,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 256 [2025-03-04 06:25:04,699 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-03-04 06:25:04,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:04,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 256 [2025-03-04 06:25:04,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:05,072 INFO L124 PetriNetUnfolderBase]: 283/2463 cut-off events. [2025-03-04 06:25:05,072 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-04 06:25:05,084 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 19584 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-03-04 06:25:05,093 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 26 selfloop transitions, 18 changer transitions 0/257 dead transitions. [2025-03-04 06:25:05,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 257 transitions, 710 flow [2025-03-04 06:25:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:25:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:25:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3989 transitions. [2025-03-04 06:25:05,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8656684027777778 [2025-03-04 06:25:05,100 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 548 flow. Second operand 18 states and 3989 transitions. [2025-03-04 06:25:05,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 257 transitions, 710 flow [2025-03-04 06:25:05,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 257 transitions, 698 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:05,106 INFO L231 Difference]: Finished difference. Result has 269 places, 253 transitions, 648 flow [2025-03-04 06:25:05,106 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-03-04 06:25:05,106 INFO L279 CegarLoopForPetriNet]: 247 programPoint places, 22 predicate places. [2025-03-04 06:25:05,106 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 253 transitions, 648 flow [2025-03-04 06:25:05,108 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-03-04 06:25:05,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:05,108 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-03-04 06:25:05,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 06:25:05,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:05,309 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-03-04 06:25:05,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash -73925181, now seen corresponding path program 3 times [2025-03-04 06:25:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913034492] [2025-03-04 06:25:05,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:25:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:05,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 8 equivalence classes. [2025-03-04 06:25:05,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:25:05,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 06:25:05,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:05,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:25:05,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:25:05,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:25:05,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:05,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:05,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:25:05,398 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:25:05,398 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 06:25:05,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-04 06:25:05,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-04 06:25:05,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-04 06:25:05,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-04 06:25:05,399 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-04 06:25:05,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:25:05,400 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:25:05,400 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:25:05,400 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:25:05,430 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:25:05,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 324 transitions, 676 flow [2025-03-04 06:25:05,460 INFO L124 PetriNetUnfolderBase]: 21/358 cut-off events. [2025-03-04 06:25:05,460 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:25:05,463 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 9. Compared 1178 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-03-04 06:25:05,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 324 transitions, 676 flow [2025-03-04 06:25:05,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 324 transitions, 676 flow [2025-03-04 06:25:05,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:25:05,466 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;@1404c8ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:25:05,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 06:25:05,468 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:25:05,468 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:25:05,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:25:05,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:05,468 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-03-04 06:25:05,468 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-03-04 06:25:05,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash 684264797, now seen corresponding path program 1 times [2025-03-04 06:25:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:05,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243192597] [2025-03-04 06:25:05,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:05,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:05,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:25:05,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:25:05,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:05,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:05,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243192597] [2025-03-04 06:25:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243192597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:25:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034952546] [2025-03-04 06:25:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:05,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:25:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:05,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:25:05,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:05,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 324 [2025-03-04 06:25:05,752 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-03-04 06:25:05,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:05,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 324 [2025-03-04 06:25:05,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:12,853 INFO L124 PetriNetUnfolderBase]: 23093/67604 cut-off events. [2025-03-04 06:25:12,853 INFO L125 PetriNetUnfolderBase]: For 7852/7852 co-relation queries the response was YES. [2025-03-04 06:25:13,168 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 897180 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-03-04 06:25:13,602 INFO L140 encePairwiseOnDemand]: 305/324 looper letters, 42 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-03-04 06:25:13,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 720 flow [2025-03-04 06:25:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:25:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:25:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1609 transitions. [2025-03-04 06:25:13,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8276748971193416 [2025-03-04 06:25:13,607 INFO L175 Difference]: Start difference. First operand has 312 places, 324 transitions, 676 flow. Second operand 6 states and 1609 transitions. [2025-03-04 06:25:13,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 720 flow [2025-03-04 06:25:13,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 299 transitions, 714 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 06:25:13,616 INFO L231 Difference]: Finished difference. Result has 304 places, 299 transitions, 630 flow [2025-03-04 06:25:13,616 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-03-04 06:25:13,617 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-04 06:25:13,617 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 299 transitions, 630 flow [2025-03-04 06:25:13,617 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-03-04 06:25:13,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:13,618 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-03-04 06:25:13,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:25:13,618 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-03-04 06:25:13,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash -998798520, now seen corresponding path program 1 times [2025-03-04 06:25:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:13,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361090059] [2025-03-04 06:25:13,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:13,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:13,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 06:25:13,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 06:25:13,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:13,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:13,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:13,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361090059] [2025-03-04 06:25:13,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361090059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:13,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:13,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:25:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858696600] [2025-03-04 06:25:13,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:13,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:25:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:13,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:25:13,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:25:13,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 324 [2025-03-04 06:25:13,662 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-03-04 06:25:13,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:13,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 324 [2025-03-04 06:25:13,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:15,266 INFO L124 PetriNetUnfolderBase]: 2033/12509 cut-off events. [2025-03-04 06:25:15,266 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-04 06:25:15,332 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 147666 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-03-04 06:25:15,379 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 24 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-03-04 06:25:15,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 300 transitions, 686 flow [2025-03-04 06:25:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:25:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:25:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 870 transitions. [2025-03-04 06:25:15,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8950617283950617 [2025-03-04 06:25:15,381 INFO L175 Difference]: Start difference. First operand has 304 places, 299 transitions, 630 flow. Second operand 3 states and 870 transitions. [2025-03-04 06:25:15,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 300 transitions, 686 flow [2025-03-04 06:25:15,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 300 transitions, 674 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:25:15,386 INFO L231 Difference]: Finished difference. Result has 302 places, 300 transitions, 632 flow [2025-03-04 06:25:15,387 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-03-04 06:25:15,388 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-04 06:25:15,388 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 300 transitions, 632 flow [2025-03-04 06:25:15,388 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-03-04 06:25:15,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:15,388 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-03-04 06:25:15,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:25:15,389 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-03-04 06:25:15,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash 9651948, now seen corresponding path program 1 times [2025-03-04 06:25:15,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:15,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315533625] [2025-03-04 06:25:15,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:15,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:15,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:25:15,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:25:15,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:15,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:15,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:15,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315533625] [2025-03-04 06:25:15,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315533625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:15,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181593423] [2025-03-04 06:25:15,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:15,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:15,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:15,430 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:25:15,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 06:25:15,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:25:15,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:25:15,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:15,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:15,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:25:15,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:15,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181593423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:15,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:15,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:25:15,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533824696] [2025-03-04 06:25:15,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:15,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:25:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:15,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:25:15,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:25:15,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-03-04 06:25:15,618 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-03-04 06:25:15,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:15,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-03-04 06:25:15,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:17,001 INFO L124 PetriNetUnfolderBase]: 2033/12524 cut-off events. [2025-03-04 06:25:17,001 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-03-04 06:25:17,077 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 147597 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-03-04 06:25:17,121 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 28 selfloop transitions, 9 changer transitions 0/308 dead transitions. [2025-03-04 06:25:17,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 308 transitions, 724 flow [2025-03-04 06:25:17,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:25:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:25:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2541 transitions. [2025-03-04 06:25:17,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8713991769547325 [2025-03-04 06:25:17,123 INFO L175 Difference]: Start difference. First operand has 302 places, 300 transitions, 632 flow. Second operand 9 states and 2541 transitions. [2025-03-04 06:25:17,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 308 transitions, 724 flow [2025-03-04 06:25:17,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:17,129 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 680 flow [2025-03-04 06:25:17,129 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-03-04 06:25:17,129 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 0 predicate places. [2025-03-04 06:25:17,129 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 680 flow [2025-03-04 06:25:17,130 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-03-04 06:25:17,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:17,131 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-03-04 06:25:17,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 06:25:17,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:17,335 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-03-04 06:25:17,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:17,336 INFO L85 PathProgramCache]: Analyzing trace with hash 742083692, now seen corresponding path program 2 times [2025-03-04 06:25:17,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:17,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157538354] [2025-03-04 06:25:17,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:17,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 06:25:17,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:25:17,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:17,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:17,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:17,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157538354] [2025-03-04 06:25:17,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157538354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:17,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430165608] [2025-03-04 06:25:17,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:17,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:17,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:17,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:25:17,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 06:25:17,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 06:25:17,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:25:17,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:17,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:25:17,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:17,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:17,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430165608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:17,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:17,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:25:17,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187863001] [2025-03-04 06:25:17,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:17,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:25:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:17,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:25:17,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:25:17,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 324 [2025-03-04 06:25:17,727 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-03-04 06:25:17,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:17,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 324 [2025-03-04 06:25:17,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:19,794 INFO L124 PetriNetUnfolderBase]: 2033/12563 cut-off events. [2025-03-04 06:25:19,794 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-03-04 06:25:19,898 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 147610 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-03-04 06:25:19,964 INFO L140 encePairwiseOnDemand]: 318/324 looper letters, 31 selfloop transitions, 18 changer transitions 0/320 dead transitions. [2025-03-04 06:25:19,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 320 transitions, 852 flow [2025-03-04 06:25:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:25:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:25:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5056 transitions. [2025-03-04 06:25:19,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669410150891632 [2025-03-04 06:25:19,969 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 680 flow. Second operand 18 states and 5056 transitions. [2025-03-04 06:25:19,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 320 transitions, 852 flow [2025-03-04 06:25:19,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 320 transitions, 840 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:19,977 INFO L231 Difference]: Finished difference. Result has 332 places, 316 transitions, 780 flow [2025-03-04 06:25:19,978 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-03-04 06:25:19,978 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, 20 predicate places. [2025-03-04 06:25:19,978 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 316 transitions, 780 flow [2025-03-04 06:25:19,980 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-03-04 06:25:19,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:19,980 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-03-04 06:25:19,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 06:25:20,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:20,181 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-03-04 06:25:20,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 837176008, now seen corresponding path program 3 times [2025-03-04 06:25:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661941334] [2025-03-04 06:25:20,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:25:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:20,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 7 equivalence classes. [2025-03-04 06:25:20,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 06:25:20,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-04 06:25:20,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:20,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:25:20,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 06:25:20,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 06:25:20,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:20,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:20,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:25:20,250 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:25:20,250 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-04 06:25:20,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-04 06:25:20,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-04 06:25:20,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-04 06:25:20,250 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-04 06:25:20,251 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-04 06:25:20,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-04 06:25:20,252 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-04 06:25:20,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:25:20,252 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:25:20,252 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:25:20,252 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 06:25:20,296 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:25:20,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 392 transitions, 824 flow [2025-03-04 06:25:20,359 INFO L124 PetriNetUnfolderBase]: 26/435 cut-off events. [2025-03-04 06:25:20,360 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:25:20,365 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 1594 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-03-04 06:25:20,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 392 transitions, 824 flow [2025-03-04 06:25:20,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 392 transitions, 824 flow [2025-03-04 06:25:20,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:25:20,370 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;@1404c8ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:25:20,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 06:25:20,373 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:25:20,373 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:25:20,373 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:25:20,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:20,374 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-03-04 06:25:20,374 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-03-04 06:25:20,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash 684715493, now seen corresponding path program 1 times [2025-03-04 06:25:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:20,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859939347] [2025-03-04 06:25:20,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:20,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:25:20,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:25:20,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:20,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:20,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:20,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859939347] [2025-03-04 06:25:20,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859939347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:20,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:25:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128597891] [2025-03-04 06:25:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:20,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:25:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:20,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:25:20,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:20,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 392 [2025-03-04 06:25:20,743 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-03-04 06:25:20,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:20,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 392 [2025-03-04 06:25:20,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand