./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.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/11_fmaxsymopt.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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:24:59,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:24:59,746 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:59,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:24:59,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:24:59,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:24:59,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:24:59,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:24:59,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:24:59,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:24:59,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:24:59,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:24:59,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:24:59,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:24:59,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:24:59,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:24:59,767 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-03-04 06:25:00,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:25:00,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:25:00,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:25:00,029 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:25:00,029 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:25:00,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-04 06:25:01,186 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e526550/03b89a7cf0c64f30b80c437bcbc6edb1/FLAGc7c5f80cd [2025-03-04 06:25:01,483 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:25:01,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-04 06:25:01,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e526550/03b89a7cf0c64f30b80c437bcbc6edb1/FLAGc7c5f80cd [2025-03-04 06:25:01,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09e526550/03b89a7cf0c64f30b80c437bcbc6edb1 [2025-03-04 06:25:01,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:25:01,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:25:01,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:25:01,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:25:01,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:25:01,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:25:01" (1/1) ... [2025-03-04 06:25:01,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58106732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:01, skipping insertion in model container [2025-03-04 06:25:01,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:25:01" (1/1) ... [2025-03-04 06:25:01,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:25:01,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:25:01,972 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:25:02,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:25:02,036 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:25:02,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02 WrapperNode [2025-03-04 06:25:02,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:25:02,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:25:02,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:25:02,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:25:02,042 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:25:02" (1/1) ... [2025-03-04 06:25:02,051 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:25:02" (1/1) ... [2025-03-04 06:25:02,065 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2025-03-04 06:25:02,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:25:02,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:25:02,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:25:02,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:25:02,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (1/1) ... [2025-03-04 06:25:02,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (1/1) ... [2025-03-04 06:25:02,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (1/1) ... [2025-03-04 06:25:02,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (1/1) ... [2025-03-04 06:25:02,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (1/1) ... [2025-03-04 06:25:02,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (1/1) ... [2025-03-04 06:25:02,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (1/1) ... [2025-03-04 06:25:02,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (1/1) ... [2025-03-04 06:25:02,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:25:02,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:25:02,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:25:02,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:25:02,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (1/1) ... [2025-03-04 06:25:02,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:25:02,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:02,112 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:25:02,115 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:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 06:25:02,132 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 06:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:25:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:25:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:25:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:25:02,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:25:02,134 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:25:02,231 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:25:02,233 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:25:02,435 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:25:02,435 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:25:02,450 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:25:02,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:25:02,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:25:02 BoogieIcfgContainer [2025-03-04 06:25:02,451 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:25:02,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:25:02,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:25:02,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:25:02,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:25:01" (1/3) ... [2025-03-04 06:25:02,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a425888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:25:02, skipping insertion in model container [2025-03-04 06:25:02,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:25:02" (2/3) ... [2025-03-04 06:25:02,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a425888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:25:02, skipping insertion in model container [2025-03-04 06:25:02,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:25:02" (3/3) ... [2025-03-04 06:25:02,458 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-04 06:25:02,468 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:25:02,470 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 118 locations, 1 initial locations, 3 loop locations, and 5 error locations. [2025-03-04 06:25:02,470 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:25:02,527 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:25:02,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 126 transitions, 256 flow [2025-03-04 06:25:02,598 INFO L124 PetriNetUnfolderBase]: 8/133 cut-off events. [2025-03-04 06:25:02,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:25:02,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 8/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 185 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2025-03-04 06:25:02,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 126 transitions, 256 flow [2025-03-04 06:25:02,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 126 transitions, 256 flow [2025-03-04 06:25:02,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:25:02,620 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;@1b33ef20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:25:02,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 06:25:02,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:25:02,637 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:25:02,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:25:02,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:02,638 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,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:25:02,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 783243572, now seen corresponding path program 1 times [2025-03-04 06:25:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:02,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62300237] [2025-03-04 06:25:02,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:02,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:25:02,764 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,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:02,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:25:03,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:03,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62300237] [2025-03-04 06:25:03,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62300237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:03,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:03,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:25:03,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627164951] [2025-03-04 06:25:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:03,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:25:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:03,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:25:03,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:03,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 126 [2025-03-04 06:25:03,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 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,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:03,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 126 [2025-03-04 06:25:03,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:03,603 INFO L124 PetriNetUnfolderBase]: 5/119 cut-off events. [2025-03-04 06:25:03,604 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:25:03,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 119 events. 5/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs, 0 based on Foata normal form. 13/121 useless extension candidates. Maximal degree in co-relation 81. Up to 16 conditions per place. [2025-03-04 06:25:03,605 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 15 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2025-03-04 06:25:03,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 276 flow [2025-03-04 06:25:03,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:25:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:25:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-03-04 06:25:03,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8187830687830688 [2025-03-04 06:25:03,621 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 256 flow. Second operand 6 states and 619 transitions. [2025-03-04 06:25:03,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 116 transitions, 276 flow [2025-03-04 06:25:03,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:25:03,629 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 246 flow [2025-03-04 06:25:03,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=119, PETRI_TRANSITIONS=116} [2025-03-04 06:25:03,636 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -2 predicate places. [2025-03-04 06:25:03,636 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 246 flow [2025-03-04 06:25:03,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 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,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:03,637 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:25:03,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:25:03,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:25:03,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1601911108, now seen corresponding path program 1 times [2025-03-04 06:25:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454110658] [2025-03-04 06:25:03,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:03,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:03,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 06:25:03,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 06:25:03,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:03,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:03,701 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,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:03,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454110658] [2025-03-04 06:25:03,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454110658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:03,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:03,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:25:03,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759292617] [2025-03-04 06:25:03,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:03,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:25:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:03,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:25:03,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:25:03,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 126 [2025-03-04 06:25:03,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 116 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:03,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 126 [2025-03-04 06:25:03,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:03,761 INFO L124 PetriNetUnfolderBase]: 5/131 cut-off events. [2025-03-04 06:25:03,761 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:25:03,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 131 events. 5/131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 96. Up to 11 conditions per place. [2025-03-04 06:25:03,763 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 9 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-03-04 06:25:03,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 272 flow [2025-03-04 06:25:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:25:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:25:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-04 06:25:03,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-04 06:25:03,767 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 246 flow. Second operand 3 states and 342 transitions. [2025-03-04 06:25:03,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 272 flow [2025-03-04 06:25:03,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:25:03,772 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 248 flow [2025-03-04 06:25:03,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2025-03-04 06:25:03,773 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -4 predicate places. [2025-03-04 06:25:03,774 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 248 flow [2025-03-04 06:25:03,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:03,774 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:25:03,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:25:03,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:25:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash 906211406, now seen corresponding path program 1 times [2025-03-04 06:25:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795142329] [2025-03-04 06:25:03,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:03,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:25:03,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:25:03,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:03,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:03,892 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,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:03,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795142329] [2025-03-04 06:25:03,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795142329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:03,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614658382] [2025-03-04 06:25:03,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:03,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:03,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:03,896 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:25:03,898 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:25:03,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:25:03,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:25:03,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:03,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:03,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:25:03,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:04,027 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:04,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:04,082 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:04,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614658382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:04,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:04,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:25:04,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614801595] [2025-03-04 06:25:04,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:04,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:25:04,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:04,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:25:04,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:25:04,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-03-04 06:25:04,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 248 flow. Second operand has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:04,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-03-04 06:25:04,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:04,256 INFO L124 PetriNetUnfolderBase]: 5/146 cut-off events. [2025-03-04 06:25:04,256 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:25:04,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 146 events. 5/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 131. Up to 11 conditions per place. [2025-03-04 06:25:04,257 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 13 selfloop transitions, 9 changer transitions 0/125 dead transitions. [2025-03-04 06:25:04,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 125 transitions, 310 flow [2025-03-04 06:25:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:25:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:25:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 987 transitions. [2025-03-04 06:25:04,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2025-03-04 06:25:04,261 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 248 flow. Second operand 9 states and 987 transitions. [2025-03-04 06:25:04,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 125 transitions, 310 flow [2025-03-04 06:25:04,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 125 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:04,264 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 296 flow [2025-03-04 06:25:04,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-03-04 06:25:04,264 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 6 predicate places. [2025-03-04 06:25:04,265 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 296 flow [2025-03-04 06:25:04,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.9) internal successors, (1089), 10 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:04,265 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:25:04,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:25:04,470 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:25:04,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:25:04,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1229087986, now seen corresponding path program 2 times [2025-03-04 06:25:04,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:04,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123484287] [2025-03-04 06:25:04,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:04,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:04,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-04 06:25:04,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:25:04,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:04,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 06:25:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:04,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123484287] [2025-03-04 06:25:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123484287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:04,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032612610] [2025-03-04 06:25:04,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:04,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:04,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:04,633 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:25:04,636 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:25:04,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-04 06:25:04,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:25:04,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:04,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:04,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:25:04,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 06:25:04,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 06:25:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032612610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:04,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:04,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:25:04,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144548920] [2025-03-04 06:25:04,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:04,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:25:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:04,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:25:04,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:25:04,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-03-04 06:25:04,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 296 flow. Second operand has 15 states, 15 states have (on average 109.06666666666666) internal successors, (1636), 15 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:04,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-03-04 06:25:04,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:05,109 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-03-04 06:25:05,109 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 06:25:05,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 185 events. 5/185 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 185. Up to 11 conditions per place. [2025-03-04 06:25:05,110 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 16 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2025-03-04 06:25:05,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 438 flow [2025-03-04 06:25:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:25:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:25:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1963 transitions. [2025-03-04 06:25:05,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655202821869489 [2025-03-04 06:25:05,114 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 296 flow. Second operand 18 states and 1963 transitions. [2025-03-04 06:25:05,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 438 flow [2025-03-04 06:25:05,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 426 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:05,117 INFO L231 Difference]: Finished difference. Result has 147 places, 133 transitions, 396 flow [2025-03-04 06:25:05,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=396, PETRI_PLACES=147, PETRI_TRANSITIONS=133} [2025-03-04 06:25:05,118 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 26 predicate places. [2025-03-04 06:25:05,118 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 133 transitions, 396 flow [2025-03-04 06:25:05,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 109.06666666666666) internal successors, (1636), 15 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:05,119 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:25:05,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:25:05,319 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:25:05,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:25:05,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1150643836, now seen corresponding path program 3 times [2025-03-04 06:25:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:05,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199737937] [2025-03-04 06:25:05,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:25:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:05,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 8 equivalence classes. [2025-03-04 06:25:05,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:25:05,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 06:25:05,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:05,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:25:05,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:25:05,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:25:05,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:05,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:05,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:25:05,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:25:05,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-04 06:25:05,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-04 06:25:05,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-04 06:25:05,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-04 06:25:05,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-04 06:25:05,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-04 06:25:05,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-04 06:25:05,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-04 06:25:05,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-04 06:25:05,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-04 06:25:05,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:25:05,449 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:25:05,451 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:25:05,451 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:25:05,484 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:25:05,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 200 transitions, 410 flow [2025-03-04 06:25:05,507 INFO L124 PetriNetUnfolderBase]: 15/216 cut-off events. [2025-03-04 06:25:05,507 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:25:05,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 216 events. 15/216 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 531 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2025-03-04 06:25:05,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 200 transitions, 410 flow [2025-03-04 06:25:05,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 200 transitions, 410 flow [2025-03-04 06:25:05,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:25:05,513 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;@1b33ef20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:25:05,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 06:25:05,516 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:25:05,516 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:25:05,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:25:05,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:05,517 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,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:25:05,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash -531312388, now seen corresponding path program 1 times [2025-03-04 06:25:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:05,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883682139] [2025-03-04 06:25:05,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:05,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:05,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:25:05,527 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,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:05,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:05,702 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,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:05,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883682139] [2025-03-04 06:25:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883682139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:05,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:05,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:25:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798098808] [2025-03-04 06:25:05,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:05,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:25:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:05,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:25:05,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:05,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 200 [2025-03-04 06:25:05,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 200 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 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,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:05,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 200 [2025-03-04 06:25:05,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:05,924 INFO L124 PetriNetUnfolderBase]: 134/844 cut-off events. [2025-03-04 06:25:05,925 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 06:25:05,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 844 events. 134/844 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5311 event pairs, 72 based on Foata normal form. 137/853 useless extension candidates. Maximal degree in co-relation 384. Up to 193 conditions per place. [2025-03-04 06:25:05,931 INFO L140 encePairwiseOnDemand]: 187/200 looper letters, 24 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-03-04 06:25:05,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 438 flow [2025-03-04 06:25:05,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:25:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:25:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2025-03-04 06:25:05,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8308333333333333 [2025-03-04 06:25:05,934 INFO L175 Difference]: Start difference. First operand has 190 places, 200 transitions, 410 flow. Second operand 6 states and 997 transitions. [2025-03-04 06:25:05,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 438 flow [2025-03-04 06:25:05,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 185 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:25:05,936 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 390 flow [2025-03-04 06:25:05,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2025-03-04 06:25:05,937 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -4 predicate places. [2025-03-04 06:25:05,937 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 390 flow [2025-03-04 06:25:05,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 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,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:05,938 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:05,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:25:05,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:25:05,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1086610975, now seen corresponding path program 1 times [2025-03-04 06:25:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600996082] [2025-03-04 06:25:05,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:05,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:05,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 06:25:05,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 06:25:05,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:05,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:05,965 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,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:05,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600996082] [2025-03-04 06:25:05,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600996082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:05,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:05,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:25:05,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783162832] [2025-03-04 06:25:05,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:05,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:25:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:05,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:25:05,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:25:05,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2025-03-04 06:25:05,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 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,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:05,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2025-03-04 06:25:05,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:06,056 INFO L124 PetriNetUnfolderBase]: 45/525 cut-off events. [2025-03-04 06:25:06,057 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 06:25:06,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 525 events. 45/525 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2385 event pairs, 20 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 550. Up to 56 conditions per place. [2025-03-04 06:25:06,061 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 14 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-03-04 06:25:06,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 426 flow [2025-03-04 06:25:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:25:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:25:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2025-03-04 06:25:06,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9033333333333333 [2025-03-04 06:25:06,063 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 390 flow. Second operand 3 states and 542 transitions. [2025-03-04 06:25:06,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 186 transitions, 426 flow [2025-03-04 06:25:06,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 414 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:25:06,066 INFO L231 Difference]: Finished difference. Result has 184 places, 186 transitions, 392 flow [2025-03-04 06:25:06,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=184, PETRI_TRANSITIONS=186} [2025-03-04 06:25:06,067 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-03-04 06:25:06,067 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 186 transitions, 392 flow [2025-03-04 06:25:06,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 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:06,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:06,068 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:06,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:25:06,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:25:06,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1869771963, now seen corresponding path program 1 times [2025-03-04 06:25:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:06,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214786111] [2025-03-04 06:25:06,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:06,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:25:06,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:25:06,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:06,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:06,134 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:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214786111] [2025-03-04 06:25:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214786111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:06,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948204975] [2025-03-04 06:25:06,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:06,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:06,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:06,137 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:06,139 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:06,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:25:06,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:25:06,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:06,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:06,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:25:06,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:06,223 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:06,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:06,257 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:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948204975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:06,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:25:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210994159] [2025-03-04 06:25:06,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:25:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:06,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:25:06,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:25:06,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-03-04 06:25:06,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 392 flow. Second operand has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 0 states have call successors, (0), 0 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:06,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:06,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-03-04 06:25:06,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:06,459 INFO L124 PetriNetUnfolderBase]: 45/540 cut-off events. [2025-03-04 06:25:06,460 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 06:25:06,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 540 events. 45/540 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2356 event pairs, 20 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 585. Up to 56 conditions per place. [2025-03-04 06:25:06,463 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 18 selfloop transitions, 9 changer transitions 0/194 dead transitions. [2025-03-04 06:25:06,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 194 transitions, 464 flow [2025-03-04 06:25:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:25:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:25:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1577 transitions. [2025-03-04 06:25:06,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761111111111111 [2025-03-04 06:25:06,466 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 392 flow. Second operand 9 states and 1577 transitions. [2025-03-04 06:25:06,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 194 transitions, 464 flow [2025-03-04 06:25:06,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 194 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:06,469 INFO L231 Difference]: Finished difference. Result has 194 places, 192 transitions, 440 flow [2025-03-04 06:25:06,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=440, PETRI_PLACES=194, PETRI_TRANSITIONS=192} [2025-03-04 06:25:06,470 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 4 predicate places. [2025-03-04 06:25:06,470 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 192 transitions, 440 flow [2025-03-04 06:25:06,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 174.0) internal successors, (1740), 10 states have internal predecessors, (1740), 0 states have call successors, (0), 0 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:06,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:06,471 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:06,481 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:06,672 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:06,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:25:06,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash 347810427, now seen corresponding path program 2 times [2025-03-04 06:25:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:06,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151797717] [2025-03-04 06:25:06,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:06,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:06,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 06:25:06,693 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:06,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:06,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 06:25:06,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151797717] [2025-03-04 06:25:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151797717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186809533] [2025-03-04 06:25:06,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:06,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:06,807 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:06,808 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:06,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-04 06:25:06,890 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:06,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:06,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:06,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:25:06,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:06,958 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 06:25:06,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 06:25:07,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186809533] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:07,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:07,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:25:07,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945977715] [2025-03-04 06:25:07,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:07,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:25:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:07,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:25:07,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:25:07,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-03-04 06:25:07,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 192 transitions, 440 flow. Second operand has 15 states, 15 states have (on average 174.13333333333333) internal successors, (2612), 15 states have internal predecessors, (2612), 0 states have call successors, (0), 0 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:07,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:07,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-03-04 06:25:07,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:07,309 INFO L124 PetriNetUnfolderBase]: 45/579 cut-off events. [2025-03-04 06:25:07,309 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 06:25:07,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 579 events. 45/579 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2331 event pairs, 20 based on Foata normal form. 3/521 useless extension candidates. Maximal degree in co-relation 547. Up to 56 conditions per place. [2025-03-04 06:25:07,313 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 21 selfloop transitions, 18 changer transitions 0/206 dead transitions. [2025-03-04 06:25:07,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 592 flow [2025-03-04 06:25:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:25:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:25:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3138 transitions. [2025-03-04 06:25:07,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8716666666666667 [2025-03-04 06:25:07,319 INFO L175 Difference]: Start difference. First operand has 194 places, 192 transitions, 440 flow. Second operand 18 states and 3138 transitions. [2025-03-04 06:25:07,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 592 flow [2025-03-04 06:25:07,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 580 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:07,322 INFO L231 Difference]: Finished difference. Result has 214 places, 202 transitions, 540 flow [2025-03-04 06:25:07,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=540, PETRI_PLACES=214, PETRI_TRANSITIONS=202} [2025-03-04 06:25:07,323 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places. [2025-03-04 06:25:07,323 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 202 transitions, 540 flow [2025-03-04 06:25:07,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 174.13333333333333) internal successors, (2612), 15 states have internal predecessors, (2612), 0 states have call successors, (0), 0 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:07,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:07,324 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:07,331 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:07,525 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:07,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-04 06:25:07,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash -296384351, now seen corresponding path program 3 times [2025-03-04 06:25:07,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:07,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566297646] [2025-03-04 06:25:07,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:25:07,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:07,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-04 06:25:07,581 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:07,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 06:25:07,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:07,581 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:25:07,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 06:25:07,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 06:25:07,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:07,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:07,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:25:07,613 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:25:07,613 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-04 06:25:07,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-04 06:25:07,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-04 06:25:07,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:25:07,615 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:25:07,615 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:25:07,615 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:25:07,650 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:25:07,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 274 transitions, 566 flow [2025-03-04 06:25:07,683 INFO L124 PetriNetUnfolderBase]: 22/299 cut-off events. [2025-03-04 06:25:07,683 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:25:07,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 299 events. 22/299 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 964 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 228. Up to 4 conditions per place. [2025-03-04 06:25:07,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 274 transitions, 566 flow [2025-03-04 06:25:07,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 274 transitions, 566 flow [2025-03-04 06:25:07,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:25:07,689 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;@1b33ef20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:25:07,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 06:25:07,691 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:25:07,692 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:25:07,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:25:07,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:07,692 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:07,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:25:07,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash 674223054, now seen corresponding path program 1 times [2025-03-04 06:25:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:07,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587813776] [2025-03-04 06:25:07,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:07,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:07,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:25:07,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:25:07,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:07,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:07,841 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:07,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:07,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587813776] [2025-03-04 06:25:07,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587813776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:07,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:07,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:25:07,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392615141] [2025-03-04 06:25:07,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:07,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:25:07,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:07,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:25:07,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:07,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-04 06:25:07,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 274 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:07,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:07,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-04 06:25:07,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:08,775 INFO L124 PetriNetUnfolderBase]: 2123/7948 cut-off events. [2025-03-04 06:25:08,776 INFO L125 PetriNetUnfolderBase]: For 622/622 co-relation queries the response was YES. [2025-03-04 06:25:08,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10942 conditions, 7948 events. 2123/7948 cut-off events. For 622/622 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 85146 event pairs, 1368 based on Foata normal form. 1386/7953 useless extension candidates. Maximal degree in co-relation 1866. Up to 2632 conditions per place. [2025-03-04 06:25:08,833 INFO L140 encePairwiseOnDemand]: 258/274 looper letters, 33 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-03-04 06:25:08,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 254 transitions, 602 flow [2025-03-04 06:25:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:25:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:25:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1375 transitions. [2025-03-04 06:25:08,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8363746958637469 [2025-03-04 06:25:08,837 INFO L175 Difference]: Start difference. First operand has 259 places, 274 transitions, 566 flow. Second operand 6 states and 1375 transitions. [2025-03-04 06:25:08,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 254 transitions, 602 flow [2025-03-04 06:25:08,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:25:08,841 INFO L231 Difference]: Finished difference. Result has 253 places, 254 transitions, 534 flow [2025-03-04 06:25:08,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=253, PETRI_TRANSITIONS=254} [2025-03-04 06:25:08,842 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -6 predicate places. [2025-03-04 06:25:08,842 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 254 transitions, 534 flow [2025-03-04 06:25:08,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.5) internal successors, (1335), 6 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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:08,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:08,843 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:08,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:25:08,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:25:08,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash -978672103, now seen corresponding path program 1 times [2025-03-04 06:25:08,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:08,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320935901] [2025-03-04 06:25:08,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:08,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:08,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:25:08,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:25:08,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:08,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:08,865 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:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:08,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320935901] [2025-03-04 06:25:08,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320935901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:08,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:08,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:25:08,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910342480] [2025-03-04 06:25:08,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:08,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:25:08,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:08,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:25:08,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:25:08,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 274 [2025-03-04 06:25:08,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 254 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 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:08,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:08,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 274 [2025-03-04 06:25:08,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:09,186 INFO L124 PetriNetUnfolderBase]: 345/2595 cut-off events. [2025-03-04 06:25:09,186 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-04 06:25:09,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 2595 events. 345/2595 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 22039 event pairs, 220 based on Foata normal form. 1/2279 useless extension candidates. Maximal degree in co-relation 3020. Up to 381 conditions per place. [2025-03-04 06:25:09,213 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 19 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-03-04 06:25:09,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 255 transitions, 580 flow [2025-03-04 06:25:09,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:25:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:25:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-03-04 06:25:09,215 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.902676399026764 [2025-03-04 06:25:09,215 INFO L175 Difference]: Start difference. First operand has 253 places, 254 transitions, 534 flow. Second operand 3 states and 742 transitions. [2025-03-04 06:25:09,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 255 transitions, 580 flow [2025-03-04 06:25:09,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 255 transitions, 568 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:25:09,219 INFO L231 Difference]: Finished difference. Result has 251 places, 255 transitions, 536 flow [2025-03-04 06:25:09,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=251, PETRI_TRANSITIONS=255} [2025-03-04 06:25:09,220 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -8 predicate places. [2025-03-04 06:25:09,220 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 255 transitions, 536 flow [2025-03-04 06:25:09,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 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:09,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:09,221 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:09,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:25:09,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:25:09,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:09,222 INFO L85 PathProgramCache]: Analyzing trace with hash 714799237, now seen corresponding path program 1 times [2025-03-04 06:25:09,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:09,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90685138] [2025-03-04 06:25:09,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:09,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:25:09,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:25:09,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:09,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:09,273 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:09,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:09,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90685138] [2025-03-04 06:25:09,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90685138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:09,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438137172] [2025-03-04 06:25:09,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:09,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:09,276 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:09,277 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:09,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:25:09,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:25:09,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:09,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:09,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:25:09,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:09,375 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:09,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:09,408 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:09,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438137172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:09,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:09,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:25:09,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48044549] [2025-03-04 06:25:09,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:09,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:25:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:09,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:25:09,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:25:09,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-03-04 06:25:09,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 255 transitions, 536 flow. Second operand has 10 states, 10 states have (on average 239.1) internal successors, (2391), 10 states have internal predecessors, (2391), 0 states have call successors, (0), 0 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:09,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:09,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-03-04 06:25:09,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:09,744 INFO L124 PetriNetUnfolderBase]: 345/2610 cut-off events. [2025-03-04 06:25:09,744 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-03-04 06:25:09,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 2610 events. 345/2610 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 21985 event pairs, 220 based on Foata normal form. 2/2295 useless extension candidates. Maximal degree in co-relation 3055. Up to 381 conditions per place. [2025-03-04 06:25:09,767 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 23 selfloop transitions, 9 changer transitions 0/263 dead transitions. [2025-03-04 06:25:09,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 263 transitions, 618 flow [2025-03-04 06:25:09,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:25:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:25:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2167 transitions. [2025-03-04 06:25:09,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8787510137875101 [2025-03-04 06:25:09,771 INFO L175 Difference]: Start difference. First operand has 251 places, 255 transitions, 536 flow. Second operand 9 states and 2167 transitions. [2025-03-04 06:25:09,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 263 transitions, 618 flow [2025-03-04 06:25:09,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 263 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:09,777 INFO L231 Difference]: Finished difference. Result has 261 places, 261 transitions, 584 flow [2025-03-04 06:25:09,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=584, PETRI_PLACES=261, PETRI_TRANSITIONS=261} [2025-03-04 06:25:09,778 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 2 predicate places. [2025-03-04 06:25:09,778 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 261 transitions, 584 flow [2025-03-04 06:25:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 239.1) internal successors, (2391), 10 states have internal predecessors, (2391), 0 states have call successors, (0), 0 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:09,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:09,779 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:09,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 06:25:09,980 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:09,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:25:09,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -565061371, now seen corresponding path program 2 times [2025-03-04 06:25:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:09,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508515910] [2025-03-04 06:25:09,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:09,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 06:25:09,994 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:09,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:09,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:10,081 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:10,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:10,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508515910] [2025-03-04 06:25:10,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508515910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:10,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995841149] [2025-03-04 06:25:10,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:10,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:10,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:10,084 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:10,085 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:10,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-04 06:25:10,166 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:10,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:10,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:10,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:25:10,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:10,240 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:10,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:10,329 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:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995841149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:10,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:10,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:25:10,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764691838] [2025-03-04 06:25:10,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:10,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:25:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:10,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:25:10,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:25:10,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-03-04 06:25:10,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 261 transitions, 584 flow. Second operand has 15 states, 15 states have (on average 239.2) internal successors, (3588), 15 states have internal predecessors, (3588), 0 states have call successors, (0), 0 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:10,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:10,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-03-04 06:25:10,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:10,835 INFO L124 PetriNetUnfolderBase]: 345/2649 cut-off events. [2025-03-04 06:25:10,835 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-04 06:25:10,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 2649 events. 345/2649 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 21967 event pairs, 220 based on Foata normal form. 3/2335 useless extension candidates. Maximal degree in co-relation 3017. Up to 381 conditions per place. [2025-03-04 06:25:10,858 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 26 selfloop transitions, 18 changer transitions 0/275 dead transitions. [2025-03-04 06:25:10,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 746 flow [2025-03-04 06:25:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:25:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:25:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4313 transitions. [2025-03-04 06:25:10,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.874493106244931 [2025-03-04 06:25:10,866 INFO L175 Difference]: Start difference. First operand has 261 places, 261 transitions, 584 flow. Second operand 18 states and 4313 transitions. [2025-03-04 06:25:10,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 746 flow [2025-03-04 06:25:10,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 275 transitions, 734 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:10,870 INFO L231 Difference]: Finished difference. Result has 281 places, 271 transitions, 684 flow [2025-03-04 06:25:10,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=684, PETRI_PLACES=281, PETRI_TRANSITIONS=271} [2025-03-04 06:25:10,871 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 22 predicate places. [2025-03-04 06:25:10,872 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 271 transitions, 684 flow [2025-03-04 06:25:10,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 239.2) internal successors, (3588), 15 states have internal predecessors, (3588), 0 states have call successors, (0), 0 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:10,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:10,873 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:10,880 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:11,074 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:11,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 06:25:11,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 275805337, now seen corresponding path program 3 times [2025-03-04 06:25:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:11,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73120465] [2025-03-04 06:25:11,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:25:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:11,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 8 equivalence classes. [2025-03-04 06:25:11,128 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:11,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 06:25:11,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:11,128 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:25:11,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:25:11,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:25:11,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:11,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:11,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:25:11,162 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:25:11,162 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-04 06:25:11,162 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-04 06:25:11,163 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-04 06:25:11,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-04 06:25:11,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-04 06:25:11,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-04 06:25:11,164 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-04 06:25:11,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:25:11,164 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-04 06:25:11,165 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:25:11,165 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:25:11,212 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:25:11,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 348 transitions, 724 flow [2025-03-04 06:25:11,247 INFO L124 PetriNetUnfolderBase]: 29/382 cut-off events. [2025-03-04 06:25:11,247 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:25:11,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 382 events. 29/382 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1415 event pairs, 0 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 307. Up to 5 conditions per place. [2025-03-04 06:25:11,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 328 places, 348 transitions, 724 flow [2025-03-04 06:25:11,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 348 transitions, 724 flow [2025-03-04 06:25:11,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:25:11,254 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;@1b33ef20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:25:11,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 06:25:11,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:25:11,256 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:25:11,256 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:25:11,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:11,256 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:11,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:25:11,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash 104882602, now seen corresponding path program 1 times [2025-03-04 06:25:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:11,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904292551] [2025-03-04 06:25:11,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:11,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:25:11,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:25:11,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:11,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:11,375 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:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904292551] [2025-03-04 06:25:11,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904292551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:11,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:11,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:25:11,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453004102] [2025-03-04 06:25:11,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:11,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:25:11,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:11,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:25:11,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:11,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 348 [2025-03-04 06:25:11,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 348 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 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:11,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:11,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 348 [2025-03-04 06:25:11,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:19,567 INFO L124 PetriNetUnfolderBase]: 27422/77788 cut-off events. [2025-03-04 06:25:19,568 INFO L125 PetriNetUnfolderBase]: For 9100/9100 co-relation queries the response was YES. [2025-03-04 06:25:19,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113885 conditions, 77788 events. 27422/77788 cut-off events. For 9100/9100 co-relation queries the response was YES. Maximal size of possible extension queue 2935. Compared 1072619 event pairs, 18864 based on Foata normal form. 13732/77272 useless extension candidates. Maximal degree in co-relation 10978. Up to 32089 conditions per place. [2025-03-04 06:25:20,421 INFO L140 encePairwiseOnDemand]: 329/348 looper letters, 42 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-03-04 06:25:20,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 323 transitions, 768 flow [2025-03-04 06:25:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:25:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:25:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2025-03-04 06:25:20,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395593869731801 [2025-03-04 06:25:20,425 INFO L175 Difference]: Start difference. First operand has 328 places, 348 transitions, 724 flow. Second operand 6 states and 1753 transitions. [2025-03-04 06:25:20,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 323 transitions, 768 flow [2025-03-04 06:25:20,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 323 transitions, 762 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 06:25:20,436 INFO L231 Difference]: Finished difference. Result has 320 places, 323 transitions, 678 flow [2025-03-04 06:25:20,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=678, PETRI_PLACES=320, PETRI_TRANSITIONS=323} [2025-03-04 06:25:20,438 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-03-04 06:25:20,438 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 323 transitions, 678 flow [2025-03-04 06:25:20,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 283.5) internal successors, (1701), 6 states have internal predecessors, (1701), 0 states have call successors, (0), 0 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,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:20,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:25:20,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:25:20,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:25:20,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash 803683252, now seen corresponding path program 1 times [2025-03-04 06:25:20,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:20,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933742005] [2025-03-04 06:25:20,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:20,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:25:20,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:25:20,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:20,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:20,485 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,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933742005] [2025-03-04 06:25:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933742005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:20,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:25:20,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556749069] [2025-03-04 06:25:20,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:20,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:25:20,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:20,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:25:20,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:25:20,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 348 [2025-03-04 06:25:20,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 323 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 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,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:20,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 348 [2025-03-04 06:25:20,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:21,924 INFO L124 PetriNetUnfolderBase]: 2345/13445 cut-off events. [2025-03-04 06:25:21,924 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-04 06:25:21,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16435 conditions, 13445 events. 2345/13445 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 161309 event pairs, 1720 based on Foata normal form. 1/11848 useless extension candidates. Maximal degree in co-relation 16370. Up to 2506 conditions per place. [2025-03-04 06:25:22,038 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 24 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-03-04 06:25:22,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 324 transitions, 734 flow [2025-03-04 06:25:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:25:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:25:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2025-03-04 06:25:22,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022988505747126 [2025-03-04 06:25:22,040 INFO L175 Difference]: Start difference. First operand has 320 places, 323 transitions, 678 flow. Second operand 3 states and 942 transitions. [2025-03-04 06:25:22,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 324 transitions, 734 flow [2025-03-04 06:25:22,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 324 transitions, 722 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:25:22,045 INFO L231 Difference]: Finished difference. Result has 318 places, 324 transitions, 680 flow [2025-03-04 06:25:22,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=318, PETRI_TRANSITIONS=324} [2025-03-04 06:25:22,046 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -10 predicate places. [2025-03-04 06:25:22,046 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 324 transitions, 680 flow [2025-03-04 06:25:22,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 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:22,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:22,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:25:22,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:25:22,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:25:22,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2122639124, now seen corresponding path program 1 times [2025-03-04 06:25:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:22,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591029452] [2025-03-04 06:25:22,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:22,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:25:22,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:25:22,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:22,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:22,088 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:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591029452] [2025-03-04 06:25:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591029452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141995561] [2025-03-04 06:25:22,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:22,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:22,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:22,090 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:22,092 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:22,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:25:22,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:25:22,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:22,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:22,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 06:25:22,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:25:22,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:25:22,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141995561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:22,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:25:22,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-04 06:25:22,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110868932] [2025-03-04 06:25:22,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:22,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:25:22,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:22,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:25:22,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:22,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 348 [2025-03-04 06:25:22,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 324 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 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:22,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:22,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 348 [2025-03-04 06:25:22,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:24,949 INFO L124 PetriNetUnfolderBase]: 5494/24147 cut-off events. [2025-03-04 06:25:24,949 INFO L125 PetriNetUnfolderBase]: For 1898/1898 co-relation queries the response was YES. [2025-03-04 06:25:25,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31651 conditions, 24147 events. 5494/24147 cut-off events. For 1898/1898 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 309416 event pairs, 3970 based on Foata normal form. 156/21149 useless extension candidates. Maximal degree in co-relation 31603. Up to 5843 conditions per place. [2025-03-04 06:25:25,207 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 41 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-03-04 06:25:25,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 340 transitions, 813 flow [2025-03-04 06:25:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:25:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:25:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2025-03-04 06:25:25,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157088122605364 [2025-03-04 06:25:25,208 INFO L175 Difference]: Start difference. First operand has 318 places, 324 transitions, 680 flow. Second operand 3 states and 956 transitions. [2025-03-04 06:25:25,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 340 transitions, 813 flow [2025-03-04 06:25:25,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 340 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:25,218 INFO L231 Difference]: Finished difference. Result has 320 places, 325 transitions, 690 flow [2025-03-04 06:25:25,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=320, PETRI_TRANSITIONS=325} [2025-03-04 06:25:25,218 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-03-04 06:25:25,218 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 325 transitions, 690 flow [2025-03-04 06:25:25,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 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:25,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:25,219 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:25,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 06:25:25,419 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:25,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:25:25,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1503085716, now seen corresponding path program 1 times [2025-03-04 06:25:25,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:25,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299235866] [2025-03-04 06:25:25,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:25,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:25,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:25:25,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:25:25,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:25,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:25:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299235866] [2025-03-04 06:25:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299235866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165041510] [2025-03-04 06:25:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:25,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:25,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:25,472 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:25,474 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:25,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 06:25:25,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 06:25:25,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:25,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:25,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:25:25,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:25:25,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:25:25,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165041510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:25,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:25,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:25:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698896682] [2025-03-04 06:25:25,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:25,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:25:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:25,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:25:25,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:25:25,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-03-04 06:25:25,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 325 transitions, 690 flow. Second operand has 10 states, 10 states have (on average 304.2) internal successors, (3042), 10 states have internal predecessors, (3042), 0 states have call successors, (0), 0 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:25,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:25,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-03-04 06:25:25,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:27,581 INFO L124 PetriNetUnfolderBase]: 2346/13479 cut-off events. [2025-03-04 06:25:27,582 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-03-04 06:25:27,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16482 conditions, 13479 events. 2346/13479 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 162013 event pairs, 1720 based on Foata normal form. 2/11876 useless extension candidates. Maximal degree in co-relation 16386. Up to 2506 conditions per place. [2025-03-04 06:25:27,704 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 28 selfloop transitions, 9 changer transitions 0/333 dead transitions. [2025-03-04 06:25:27,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 333 transitions, 782 flow [2025-03-04 06:25:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:25:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:25:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2757 transitions. [2025-03-04 06:25:27,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8802681992337165 [2025-03-04 06:25:27,706 INFO L175 Difference]: Start difference. First operand has 320 places, 325 transitions, 690 flow. Second operand 9 states and 2757 transitions. [2025-03-04 06:25:27,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 333 transitions, 782 flow [2025-03-04 06:25:27,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 333 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:27,713 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 738 flow [2025-03-04 06:25:27,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=738, PETRI_PLACES=330, PETRI_TRANSITIONS=331} [2025-03-04 06:25:27,714 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 2 predicate places. [2025-03-04 06:25:27,714 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 738 flow [2025-03-04 06:25:27,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.2) internal successors, (3042), 10 states have internal predecessors, (3042), 0 states have call successors, (0), 0 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:27,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:27,715 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:27,721 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:27,915 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:27,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:25:27,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1189562772, now seen corresponding path program 2 times [2025-03-04 06:25:27,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:27,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953939855] [2025-03-04 06:25:27,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:27,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:27,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 06:25:27,933 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:27,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:27,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:28,016 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:28,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:28,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953939855] [2025-03-04 06:25:28,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953939855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:25:28,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637791764] [2025-03-04 06:25:28,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:25:28,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:28,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:25:28,019 INFO L229 MonitoredProcess]: Starting monitored process 10 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:28,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 06:25:28,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 06:25:28,112 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:28,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:25:28,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:28,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:25:28,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:25:28,160 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:28,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:25:28,236 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:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637791764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:25:28,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:25:28,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-04 06:25:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474735405] [2025-03-04 06:25:28,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:25:28,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 06:25:28,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:28,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 06:25:28,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:25:28,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-03-04 06:25:28,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 331 transitions, 738 flow. Second operand has 15 states, 15 states have (on average 304.26666666666665) internal successors, (4564), 15 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:28,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:28,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-03-04 06:25:28,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:25:30,142 INFO L124 PetriNetUnfolderBase]: 2346/13518 cut-off events. [2025-03-04 06:25:30,142 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-03-04 06:25:30,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16575 conditions, 13518 events. 2346/13518 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 161844 event pairs, 1720 based on Foata normal form. 3/11916 useless extension candidates. Maximal degree in co-relation 16390. Up to 2506 conditions per place. [2025-03-04 06:25:30,286 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 31 selfloop transitions, 18 changer transitions 0/345 dead transitions. [2025-03-04 06:25:30,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 345 transitions, 910 flow [2025-03-04 06:25:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 06:25:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 06:25:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5488 transitions. [2025-03-04 06:25:30,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876117496807152 [2025-03-04 06:25:30,289 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 738 flow. Second operand 18 states and 5488 transitions. [2025-03-04 06:25:30,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 345 transitions, 910 flow [2025-03-04 06:25:30,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 898 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 06:25:30,297 INFO L231 Difference]: Finished difference. Result has 350 places, 341 transitions, 838 flow [2025-03-04 06:25:30,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=838, PETRI_PLACES=350, PETRI_TRANSITIONS=341} [2025-03-04 06:25:30,297 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 22 predicate places. [2025-03-04 06:25:30,298 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 341 transitions, 838 flow [2025-03-04 06:25:30,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 304.26666666666665) internal successors, (4564), 15 states have internal predecessors, (4564), 0 states have call successors, (0), 0 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:30,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:30,299 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:30,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 06:25:30,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:25:30,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-04 06:25:30,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:30,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1970315428, now seen corresponding path program 3 times [2025-03-04 06:25:30,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:30,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162845220] [2025-03-04 06:25:30,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:25:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:30,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-03-04 06:25:30,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 06:25:30,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-04 06:25:30,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:30,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:25:30,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 06:25:30,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 06:25:30,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:30,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:25:30,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:25:30,567 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:25:30,567 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-04 06:25:30,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-04 06:25:30,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-04 06:25:30,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:25:30,570 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-03-04 06:25:30,571 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:25:30,571 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-04 06:25:30,613 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:25:30,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 422 transitions, 884 flow [2025-03-04 06:25:30,658 INFO L124 PetriNetUnfolderBase]: 36/465 cut-off events. [2025-03-04 06:25:30,658 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 06:25:30,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 465 events. 36/465 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1913 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 395. Up to 6 conditions per place. [2025-03-04 06:25:30,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 422 transitions, 884 flow [2025-03-04 06:25:30,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 422 transitions, 884 flow [2025-03-04 06:25:30,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:25:30,669 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;@1b33ef20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:25:30,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 06:25:30,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:25:30,671 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-04 06:25:30,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:25:30,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:25:30,671 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:30,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:25:30,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:25:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2055633552, now seen corresponding path program 1 times [2025-03-04 06:25:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:25:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596883072] [2025-03-04 06:25:30,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:25:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:25:30,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:25:30,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:25:30,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:25:30,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:25:30,775 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:30,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:25:30,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596883072] [2025-03-04 06:25:30,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596883072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:25:30,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:25:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:25:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046649125] [2025-03-04 06:25:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:25:30,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:25:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:25:30,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:25:30,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:25:30,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 422 [2025-03-04 06:25:30,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 422 transitions, 884 flow. Second operand has 6 states, 6 states have (on average 344.5) internal successors, (2067), 6 states have internal predecessors, (2067), 0 states have call successors, (0), 0 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:30,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:25:30,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 422 [2025-03-04 06:25:30,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand