./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 10:44:10,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:44:10,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:44:10,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:44:10,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:44:10,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:44:10,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:44:10,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:44:10,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:44:10,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:44:10,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:44:10,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:44:10,483 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:44:10,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:44:10,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:44:10,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:44:10,484 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-17 10:44:10,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:44:10,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:44:10,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:44:10,728 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:44:10,728 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:44:10,729 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-17 10:44:11,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02777db70/fd22176f805c4f56aca2166544710cdf/FLAG1faf534ba [2025-03-17 10:44:12,094 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:44:12,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-17 10:44:12,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02777db70/fd22176f805c4f56aca2166544710cdf/FLAG1faf534ba [2025-03-17 10:44:12,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02777db70/fd22176f805c4f56aca2166544710cdf [2025-03-17 10:44:12,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:44:12,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:44:12,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:44:12,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:44:12,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:44:12,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532e5026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12, skipping insertion in model container [2025-03-17 10:44:12,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:44:12,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:44:12,360 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:44:12,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:44:12,431 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:44:12,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12 WrapperNode [2025-03-17 10:44:12,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:44:12,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:44:12,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:44:12,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:44:12,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,458 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2025-03-17 10:44:12,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:44:12,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:44:12,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:44:12,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:44:12,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:44:12,473 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:44:12,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:44:12,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:44:12,474 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (1/1) ... [2025-03-17 10:44:12,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:44:12,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:12,497 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-17 10:44:12,499 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-17 10:44:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:44:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 10:44:12,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 10:44:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:44:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:44:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:44:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:44:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:44:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:44:12,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:44:12,514 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:44:12,604 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:44:12,605 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:44:12,811 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:44:12,811 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:44:12,825 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:44:12,825 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:44:12,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:44:12 BoogieIcfgContainer [2025-03-17 10:44:12,825 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:44:12,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:44:12,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:44:12,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:44:12,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:44:12" (1/3) ... [2025-03-17 10:44:12,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5664a611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:44:12, skipping insertion in model container [2025-03-17 10:44:12,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:44:12" (2/3) ... [2025-03-17 10:44:12,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5664a611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:44:12, skipping insertion in model container [2025-03-17 10:44:12,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:44:12" (3/3) ... [2025-03-17 10:44:12,832 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-17 10:44:12,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:44:12,845 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-17 10:44:12,845 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:44:12,900 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:12,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 126 transitions, 256 flow [2025-03-17 10:44:12,970 INFO L124 PetriNetUnfolderBase]: 8/133 cut-off events. [2025-03-17 10:44:12,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:12,977 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-17 10:44:12,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 126 transitions, 256 flow [2025-03-17 10:44:12,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 126 transitions, 256 flow [2025-03-17 10:44:12,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:12,997 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;@7b96f6b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:13,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 10:44:13,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:13,015 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:13,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:13,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:13,016 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-17 10:44:13,016 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-17 10:44:13,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash 517109187, now seen corresponding path program 1 times [2025-03-17 10:44:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:13,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387014190] [2025-03-17 10:44:13,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:13,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:13,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:13,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:13,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:13,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:13,688 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-17 10:44:13,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:13,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387014190] [2025-03-17 10:44:13,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387014190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:13,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:13,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:13,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186264076] [2025-03-17 10:44:13,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:13,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:13,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:13,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:13,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 126 [2025-03-17 10:44:13,875 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-17 10:44:13,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:13,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 126 [2025-03-17 10:44:13,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:13,925 INFO L124 PetriNetUnfolderBase]: 5/119 cut-off events. [2025-03-17 10:44:13,925 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:44:13,926 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 130 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-17 10:44:13,927 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 15 selfloop transitions, 5 changer transitions 0/116 dead transitions. [2025-03-17 10:44:13,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 116 transitions, 276 flow [2025-03-17 10:44:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-03-17 10:44:13,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8187830687830688 [2025-03-17 10:44:13,943 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 256 flow. Second operand 6 states and 619 transitions. [2025-03-17 10:44:13,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 116 transitions, 276 flow [2025-03-17 10:44:13,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 116 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:13,954 INFO L231 Difference]: Finished difference. Result has 119 places, 116 transitions, 246 flow [2025-03-17 10:44:13,956 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-17 10:44:13,958 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -2 predicate places. [2025-03-17 10:44:13,959 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 116 transitions, 246 flow [2025-03-17 10:44:13,959 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-17 10:44:13,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:13,959 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-17 10:44:13,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:44:13,960 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-17 10:44:13,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1600106703, now seen corresponding path program 1 times [2025-03-17 10:44:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620684320] [2025-03-17 10:44:13,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:13,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 10:44:13,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 10:44:13,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:13,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:14,018 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-17 10:44:14,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:14,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620684320] [2025-03-17 10:44:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620684320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863139136] [2025-03-17 10:44:14,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:14,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:14,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:14,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:14,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 126 [2025-03-17 10:44:14,042 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-17 10:44:14,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:14,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 126 [2025-03-17 10:44:14,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:14,074 INFO L124 PetriNetUnfolderBase]: 5/131 cut-off events. [2025-03-17 10:44:14,075 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 10:44:14,075 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-17 10:44:14,076 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 9 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-03-17 10:44:14,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 272 flow [2025-03-17 10:44:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-17 10:44:14,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-17 10:44:14,077 INFO L175 Difference]: Start difference. First operand has 119 places, 116 transitions, 246 flow. Second operand 3 states and 342 transitions. [2025-03-17 10:44:14,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 272 flow [2025-03-17 10:44:14,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:44:14,080 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 248 flow [2025-03-17 10:44:14,080 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-17 10:44:14,080 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -4 predicate places. [2025-03-17 10:44:14,081 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 248 flow [2025-03-17 10:44:14,081 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-17 10:44:14,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:14,081 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-17 10:44:14,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:44:14,081 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-17 10:44:14,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:14,082 INFO L85 PathProgramCache]: Analyzing trace with hash -25414788, now seen corresponding path program 1 times [2025-03-17 10:44:14,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:14,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041304585] [2025-03-17 10:44:14,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:14,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 10:44:14,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 10:44:14,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:14,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:14,191 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-17 10:44:14,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041304585] [2025-03-17 10:44:14,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041304585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779246218] [2025-03-17 10:44:14,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:14,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:14,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:14,195 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-17 10:44:14,197 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-17 10:44:14,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 10:44:14,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 10:44:14,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:14,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:14,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:44:14,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:14,317 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-17 10:44:14,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:14,380 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-17 10:44:14,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779246218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:14,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:44:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161190329] [2025-03-17 10:44:14,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:14,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:44:14,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:14,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:44:14,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:44:14,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-03-17 10:44:14,470 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-17 10:44:14,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:14,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-03-17 10:44:14,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:14,576 INFO L124 PetriNetUnfolderBase]: 5/146 cut-off events. [2025-03-17 10:44:14,576 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:44:14,578 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-17 10:44:14,578 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 13 selfloop transitions, 9 changer transitions 0/125 dead transitions. [2025-03-17 10:44:14,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 125 transitions, 310 flow [2025-03-17 10:44:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:44:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:44:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 987 transitions. [2025-03-17 10:44:14,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2025-03-17 10:44:14,585 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 248 flow. Second operand 9 states and 987 transitions. [2025-03-17 10:44:14,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 125 transitions, 310 flow [2025-03-17 10:44:14,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 125 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:14,590 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 296 flow [2025-03-17 10:44:14,590 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-17 10:44:14,591 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 6 predicate places. [2025-03-17 10:44:14,591 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 296 flow [2025-03-17 10:44:14,592 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-17 10:44:14,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:14,593 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-17 10:44:14,602 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-17 10:44:14,793 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-17 10:44:14,794 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-17 10:44:14,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1433762212, now seen corresponding path program 2 times [2025-03-17 10:44:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255182186] [2025-03-17 10:44:14,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:14,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-17 10:44:14,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:44:14,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:14,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:14,966 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-17 10:44:14,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:14,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255182186] [2025-03-17 10:44:14,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255182186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87429604] [2025-03-17 10:44:14,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:14,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:14,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:14,969 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-17 10:44:14,970 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-17 10:44:15,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-17 10:44:15,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 10:44:15,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:15,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:15,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:44:15,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:15,103 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-17 10:44:15,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:15,237 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-17 10:44:15,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87429604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:15,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:44:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613091979] [2025-03-17 10:44:15,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:15,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:44:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:15,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:44:15,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:44:15,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 126 [2025-03-17 10:44:15,339 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-17 10:44:15,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:15,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 126 [2025-03-17 10:44:15,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:15,523 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-03-17 10:44:15,524 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 10:44:15,524 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-17 10:44:15,525 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 16 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2025-03-17 10:44:15,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 438 flow [2025-03-17 10:44:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:44:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:44:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1963 transitions. [2025-03-17 10:44:15,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655202821869489 [2025-03-17 10:44:15,531 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 296 flow. Second operand 18 states and 1963 transitions. [2025-03-17 10:44:15,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 438 flow [2025-03-17 10:44:15,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 426 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:15,535 INFO L231 Difference]: Finished difference. Result has 147 places, 133 transitions, 396 flow [2025-03-17 10:44:15,535 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-17 10:44:15,536 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 26 predicate places. [2025-03-17 10:44:15,536 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 133 transitions, 396 flow [2025-03-17 10:44:15,537 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-17 10:44:15,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:15,538 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-17 10:44:15,549 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-17 10:44:15,738 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-17 10:44:15,739 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-17 10:44:15,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1762114607, now seen corresponding path program 3 times [2025-03-17 10:44:15,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:15,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223578104] [2025-03-17 10:44:15,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:44:15,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:15,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 8 equivalence classes. [2025-03-17 10:44:15,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 10:44:15,805 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:44:15,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:15,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:15,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 10:44:15,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 10:44:15,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:15,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:15,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:15,847 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:15,848 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 10:44:15,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 10:44:15,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 10:44:15,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 10:44:15,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 10:44:15,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 10:44:15,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-17 10:44:15,849 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 10:44:15,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 10:44:15,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 10:44:15,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:44:15,850 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:44:15,852 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:15,852 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 10:44:15,886 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:15,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 200 transitions, 410 flow [2025-03-17 10:44:15,911 INFO L124 PetriNetUnfolderBase]: 15/216 cut-off events. [2025-03-17 10:44:15,912 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:44:15,914 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 532 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-17 10:44:15,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 200 transitions, 410 flow [2025-03-17 10:44:15,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 200 transitions, 410 flow [2025-03-17 10:44:15,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:15,918 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;@7b96f6b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:15,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 10:44:15,923 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:15,923 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:15,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:15,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:15,923 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-17 10:44:15,923 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-17 10:44:15,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash -797446773, now seen corresponding path program 1 times [2025-03-17 10:44:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:15,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532006742] [2025-03-17 10:44:15,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:15,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:15,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:15,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:15,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:16,124 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-17 10:44:16,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:16,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532006742] [2025-03-17 10:44:16,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532006742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:16,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:16,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079076] [2025-03-17 10:44:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:16,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:16,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:16,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:16,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 200 [2025-03-17 10:44:16,281 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-17 10:44:16,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:16,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 200 [2025-03-17 10:44:16,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:16,415 INFO L124 PetriNetUnfolderBase]: 134/844 cut-off events. [2025-03-17 10:44:16,415 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-17 10:44:16,418 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 5317 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-17 10:44:16,420 INFO L140 encePairwiseOnDemand]: 187/200 looper letters, 24 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2025-03-17 10:44:16,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 438 flow [2025-03-17 10:44:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2025-03-17 10:44:16,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8308333333333333 [2025-03-17 10:44:16,422 INFO L175 Difference]: Start difference. First operand has 190 places, 200 transitions, 410 flow. Second operand 6 states and 997 transitions. [2025-03-17 10:44:16,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 438 flow [2025-03-17 10:44:16,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 185 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:16,425 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 390 flow [2025-03-17 10:44:16,425 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-17 10:44:16,425 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -4 predicate places. [2025-03-17 10:44:16,425 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 390 flow [2025-03-17 10:44:16,426 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-17 10:44:16,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:16,426 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-17 10:44:16,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:44:16,426 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-17 10:44:16,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:16,427 INFO L85 PathProgramCache]: Analyzing trace with hash -777311470, now seen corresponding path program 1 times [2025-03-17 10:44:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:16,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197134748] [2025-03-17 10:44:16,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:16,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:16,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 10:44:16,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 10:44:16,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:16,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:16,453 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-17 10:44:16,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:16,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197134748] [2025-03-17 10:44:16,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197134748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:16,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:16,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216386678] [2025-03-17 10:44:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:16,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:16,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:16,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:16,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:16,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2025-03-17 10:44:16,472 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-17 10:44:16,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:16,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2025-03-17 10:44:16,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:16,550 INFO L124 PetriNetUnfolderBase]: 45/525 cut-off events. [2025-03-17 10:44:16,550 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 10:44:16,552 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-17 10:44:16,554 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 14 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-03-17 10:44:16,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 186 transitions, 426 flow [2025-03-17 10:44:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2025-03-17 10:44:16,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9033333333333333 [2025-03-17 10:44:16,555 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 390 flow. Second operand 3 states and 542 transitions. [2025-03-17 10:44:16,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 186 transitions, 426 flow [2025-03-17 10:44:16,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 186 transitions, 414 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:44:16,559 INFO L231 Difference]: Finished difference. Result has 184 places, 186 transitions, 392 flow [2025-03-17 10:44:16,560 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-17 10:44:16,560 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, -6 predicate places. [2025-03-17 10:44:16,561 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 186 transitions, 392 flow [2025-03-17 10:44:16,562 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-17 10:44:16,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:16,562 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-17 10:44:16,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:44:16,562 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-17 10:44:16,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1332811463, now seen corresponding path program 1 times [2025-03-17 10:44:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768066964] [2025-03-17 10:44:16,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:16,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 10:44:16,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 10:44:16,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:16,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:16,619 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-17 10:44:16,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768066964] [2025-03-17 10:44:16,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768066964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227534940] [2025-03-17 10:44:16,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:16,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:16,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:16,622 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-17 10:44:16,624 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-17 10:44:16,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 10:44:16,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 10:44:16,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:16,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:16,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:44:16,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:16,711 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-17 10:44:16,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:16,743 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-17 10:44:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227534940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:16,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:16,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:44:16,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865461457] [2025-03-17 10:44:16,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:16,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:44:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:16,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:44:16,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:44:16,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-03-17 10:44:16,796 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-17 10:44:16,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:16,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-03-17 10:44:16,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:16,893 INFO L124 PetriNetUnfolderBase]: 45/540 cut-off events. [2025-03-17 10:44:16,893 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 10:44:16,894 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-17 10:44:16,897 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 18 selfloop transitions, 9 changer transitions 0/194 dead transitions. [2025-03-17 10:44:16,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 194 transitions, 464 flow [2025-03-17 10:44:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:44:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:44:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1577 transitions. [2025-03-17 10:44:16,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761111111111111 [2025-03-17 10:44:16,899 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 392 flow. Second operand 9 states and 1577 transitions. [2025-03-17 10:44:16,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 194 transitions, 464 flow [2025-03-17 10:44:16,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 194 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:16,902 INFO L231 Difference]: Finished difference. Result has 194 places, 192 transitions, 440 flow [2025-03-17 10:44:16,903 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-17 10:44:16,904 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 4 predicate places. [2025-03-17 10:44:16,904 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 192 transitions, 440 flow [2025-03-17 10:44:16,905 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-17 10:44:16,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:16,905 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-17 10:44:16,911 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-17 10:44:17,110 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-17 10:44:17,110 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-17 10:44:17,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1978113191, now seen corresponding path program 2 times [2025-03-17 10:44:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:17,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988768012] [2025-03-17 10:44:17,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:17,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-17 10:44:17,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:44:17,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:17,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:17,231 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-17 10:44:17,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:17,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988768012] [2025-03-17 10:44:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988768012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:17,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779459994] [2025-03-17 10:44:17,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:17,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:17,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:17,234 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-17 10:44:17,251 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-17 10:44:17,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-03-17 10:44:17,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 10:44:17,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:17,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:17,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:44:17,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:17,381 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-17 10:44:17,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:17,460 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-17 10:44:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779459994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:17,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:17,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:44:17,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358648975] [2025-03-17 10:44:17,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:17,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:44:17,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:17,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:44:17,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:44:17,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 200 [2025-03-17 10:44:17,567 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-17 10:44:17,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:17,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 200 [2025-03-17 10:44:17,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:17,737 INFO L124 PetriNetUnfolderBase]: 45/579 cut-off events. [2025-03-17 10:44:17,737 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-17 10:44:17,739 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 2361 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-17 10:44:17,742 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 21 selfloop transitions, 18 changer transitions 0/206 dead transitions. [2025-03-17 10:44:17,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 206 transitions, 592 flow [2025-03-17 10:44:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:44:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:44:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3138 transitions. [2025-03-17 10:44:17,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8716666666666667 [2025-03-17 10:44:17,747 INFO L175 Difference]: Start difference. First operand has 194 places, 192 transitions, 440 flow. Second operand 18 states and 3138 transitions. [2025-03-17 10:44:17,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 206 transitions, 592 flow [2025-03-17 10:44:17,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 580 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:17,750 INFO L231 Difference]: Finished difference. Result has 214 places, 202 transitions, 540 flow [2025-03-17 10:44:17,751 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-17 10:44:17,751 INFO L279 CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places. [2025-03-17 10:44:17,751 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 202 transitions, 540 flow [2025-03-17 10:44:17,753 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-17 10:44:17,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:17,754 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-17 10:44:17,761 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-17 10:44:17,954 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-17 10:44:17,954 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-17 10:44:17,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1309983374, now seen corresponding path program 3 times [2025-03-17 10:44:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:17,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172241181] [2025-03-17 10:44:17,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:44:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:17,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 122 statements into 8 equivalence classes. [2025-03-17 10:44:18,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 10:44:18,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:44:18,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:18,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:18,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 10:44:18,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 10:44:18,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:18,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:18,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:18,040 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:18,040 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-17 10:44:18,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-17 10:44:18,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-17 10:44:18,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-17 10:44:18,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-17 10:44:18,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:44:18,041 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:44:18,042 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:18,042 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 10:44:18,068 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:18,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 274 transitions, 566 flow [2025-03-17 10:44:18,089 INFO L124 PetriNetUnfolderBase]: 22/299 cut-off events. [2025-03-17 10:44:18,090 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:44:18,092 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 960 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-17 10:44:18,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 274 transitions, 566 flow [2025-03-17 10:44:18,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 274 transitions, 566 flow [2025-03-17 10:44:18,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:18,095 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;@7b96f6b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:18,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 10:44:18,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:18,097 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:18,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:18,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:18,098 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-17 10:44:18,098 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-17 10:44:18,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:18,098 INFO L85 PathProgramCache]: Analyzing trace with hash 408088669, now seen corresponding path program 1 times [2025-03-17 10:44:18,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:18,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679671803] [2025-03-17 10:44:18,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:18,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:18,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:18,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:18,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:18,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:18,244 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-17 10:44:18,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:18,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679671803] [2025-03-17 10:44:18,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679671803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:18,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:18,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:18,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18625603] [2025-03-17 10:44:18,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:18,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:18,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:18,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:18,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:18,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 274 [2025-03-17 10:44:18,377 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-17 10:44:18,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:18,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 274 [2025-03-17 10:44:18,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:19,158 INFO L124 PetriNetUnfolderBase]: 2123/7948 cut-off events. [2025-03-17 10:44:19,158 INFO L125 PetriNetUnfolderBase]: For 622/622 co-relation queries the response was YES. [2025-03-17 10:44:19,183 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 85109 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-17 10:44:19,215 INFO L140 encePairwiseOnDemand]: 258/274 looper letters, 33 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-03-17 10:44:19,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 254 transitions, 602 flow [2025-03-17 10:44:19,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1375 transitions. [2025-03-17 10:44:19,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8363746958637469 [2025-03-17 10:44:19,218 INFO L175 Difference]: Start difference. First operand has 259 places, 274 transitions, 566 flow. Second operand 6 states and 1375 transitions. [2025-03-17 10:44:19,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 254 transitions, 602 flow [2025-03-17 10:44:19,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:19,223 INFO L231 Difference]: Finished difference. Result has 253 places, 254 transitions, 534 flow [2025-03-17 10:44:19,223 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-17 10:44:19,224 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -6 predicate places. [2025-03-17 10:44:19,224 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 254 transitions, 534 flow [2025-03-17 10:44:19,225 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-17 10:44:19,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:19,225 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-17 10:44:19,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:44:19,225 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-17 10:44:19,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1584824296, now seen corresponding path program 1 times [2025-03-17 10:44:19,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:19,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803755278] [2025-03-17 10:44:19,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:19,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:19,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:44:19,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:44:19,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:19,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:19,246 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-17 10:44:19,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:19,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803755278] [2025-03-17 10:44:19,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803755278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:19,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:19,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:19,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530671646] [2025-03-17 10:44:19,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:19,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:19,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:19,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:19,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:19,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 274 [2025-03-17 10:44:19,267 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-17 10:44:19,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:19,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 274 [2025-03-17 10:44:19,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:19,575 INFO L124 PetriNetUnfolderBase]: 345/2595 cut-off events. [2025-03-17 10:44:19,575 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-17 10:44:19,583 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 80. Compared 21923 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-17 10:44:19,594 INFO L140 encePairwiseOnDemand]: 271/274 looper letters, 19 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2025-03-17 10:44:19,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 255 transitions, 580 flow [2025-03-17 10:44:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-03-17 10:44:19,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.902676399026764 [2025-03-17 10:44:19,596 INFO L175 Difference]: Start difference. First operand has 253 places, 254 transitions, 534 flow. Second operand 3 states and 742 transitions. [2025-03-17 10:44:19,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 255 transitions, 580 flow [2025-03-17 10:44:19,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 255 transitions, 568 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:44:19,599 INFO L231 Difference]: Finished difference. Result has 251 places, 255 transitions, 536 flow [2025-03-17 10:44:19,600 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-17 10:44:19,601 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, -8 predicate places. [2025-03-17 10:44:19,601 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 255 transitions, 536 flow [2025-03-17 10:44:19,601 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-17 10:44:19,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:19,601 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-17 10:44:19,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:44:19,601 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-17 10:44:19,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1070032145, now seen corresponding path program 1 times [2025-03-17 10:44:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40764234] [2025-03-17 10:44:19,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:19,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:44:19,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:44:19,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:19,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:19,647 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-17 10:44:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40764234] [2025-03-17 10:44:19,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40764234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156247134] [2025-03-17 10:44:19,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:19,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:19,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:19,650 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-17 10:44:19,652 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-17 10:44:19,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:44:19,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:44:19,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:19,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:19,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:44:19,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:19,747 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-17 10:44:19,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:19,780 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-17 10:44:19,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156247134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:19,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:19,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:44:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216679229] [2025-03-17 10:44:19,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:19,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:44:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:19,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:44:19,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:44:19,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-03-17 10:44:19,838 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-17 10:44:19,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:19,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-03-17 10:44:19,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:20,170 INFO L124 PetriNetUnfolderBase]: 345/2610 cut-off events. [2025-03-17 10:44:20,170 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2025-03-17 10:44:20,179 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 21901 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-17 10:44:20,185 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 23 selfloop transitions, 9 changer transitions 0/263 dead transitions. [2025-03-17 10:44:20,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 263 transitions, 618 flow [2025-03-17 10:44:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:44:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:44:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2167 transitions. [2025-03-17 10:44:20,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8787510137875101 [2025-03-17 10:44:20,189 INFO L175 Difference]: Start difference. First operand has 251 places, 255 transitions, 536 flow. Second operand 9 states and 2167 transitions. [2025-03-17 10:44:20,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 263 transitions, 618 flow [2025-03-17 10:44:20,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 263 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:20,194 INFO L231 Difference]: Finished difference. Result has 261 places, 261 transitions, 584 flow [2025-03-17 10:44:20,194 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-17 10:44:20,195 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 2 predicate places. [2025-03-17 10:44:20,195 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 261 transitions, 584 flow [2025-03-17 10:44:20,195 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-17 10:44:20,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:20,196 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-17 10:44:20,202 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-17 10:44:20,396 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-17 10:44:20,397 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-17 10:44:20,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:20,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1279832975, now seen corresponding path program 2 times [2025-03-17 10:44:20,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:20,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63655642] [2025-03-17 10:44:20,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:20,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 10:44:20,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:44:20,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:20,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:20,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:20,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63655642] [2025-03-17 10:44:20,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63655642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:20,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941096646] [2025-03-17 10:44:20,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:20,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:20,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:20,510 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-17 10:44:20,512 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-17 10:44:20,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-17 10:44:20,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:44:20,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:20,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:20,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:44:20,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:20,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:44:20,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941096646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:20,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:44:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73875823] [2025-03-17 10:44:20,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:20,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:44:20,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:20,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:44:20,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:44:20,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 274 [2025-03-17 10:44:20,826 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-17 10:44:20,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:20,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 274 [2025-03-17 10:44:20,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:21,282 INFO L124 PetriNetUnfolderBase]: 345/2649 cut-off events. [2025-03-17 10:44:21,283 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2025-03-17 10:44:21,296 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 21985 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-17 10:44:21,305 INFO L140 encePairwiseOnDemand]: 268/274 looper letters, 26 selfloop transitions, 18 changer transitions 0/275 dead transitions. [2025-03-17 10:44:21,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 746 flow [2025-03-17 10:44:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:44:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:44:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4313 transitions. [2025-03-17 10:44:21,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.874493106244931 [2025-03-17 10:44:21,314 INFO L175 Difference]: Start difference. First operand has 261 places, 261 transitions, 584 flow. Second operand 18 states and 4313 transitions. [2025-03-17 10:44:21,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 746 flow [2025-03-17 10:44:21,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 275 transitions, 734 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:21,319 INFO L231 Difference]: Finished difference. Result has 281 places, 271 transitions, 684 flow [2025-03-17 10:44:21,321 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-17 10:44:21,321 INFO L279 CegarLoopForPetriNet]: 259 programPoint places, 22 predicate places. [2025-03-17 10:44:21,321 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 271 transitions, 684 flow [2025-03-17 10:44:21,322 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-17 10:44:21,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:21,323 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-17 10:44:21,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 10:44:21,524 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-17 10:44:21,524 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-17 10:44:21,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash 565920264, now seen corresponding path program 3 times [2025-03-17 10:44:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:21,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049230769] [2025-03-17 10:44:21,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:44:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:21,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 128 statements into 7 equivalence classes. [2025-03-17 10:44:21,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 10:44:21,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-17 10:44:21,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:21,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:21,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 10:44:21,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 10:44:21,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:21,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:21,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:21,620 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:21,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-17 10:44:21,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-17 10:44:21,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-17 10:44:21,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-17 10:44:21,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-17 10:44:21,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-17 10:44:21,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:44:21,622 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-17 10:44:21,622 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:21,622 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 10:44:21,664 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:21,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 348 transitions, 724 flow [2025-03-17 10:44:21,715 INFO L124 PetriNetUnfolderBase]: 29/382 cut-off events. [2025-03-17 10:44:21,715 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 10:44:21,719 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 1417 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-17 10:44:21,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 328 places, 348 transitions, 724 flow [2025-03-17 10:44:21,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 348 transitions, 724 flow [2025-03-17 10:44:21,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:21,724 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;@7b96f6b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:21,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-17 10:44:21,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:21,727 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:21,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:21,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:21,727 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-17 10:44:21,727 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-17 10:44:21,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash -161251783, now seen corresponding path program 1 times [2025-03-17 10:44:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:21,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389800578] [2025-03-17 10:44:21,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:21,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:21,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:21,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:21,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:21,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:21,885 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-17 10:44:21,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:21,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389800578] [2025-03-17 10:44:21,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389800578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:21,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:21,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706033479] [2025-03-17 10:44:21,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:21,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:21,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:21,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:22,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 348 [2025-03-17 10:44:22,038 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-17 10:44:22,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:22,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 348 [2025-03-17 10:44:22,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:30,048 INFO L124 PetriNetUnfolderBase]: 27422/77788 cut-off events. [2025-03-17 10:44:30,049 INFO L125 PetriNetUnfolderBase]: For 9100/9100 co-relation queries the response was YES. [2025-03-17 10:44:30,410 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 1072606 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-17 10:44:30,853 INFO L140 encePairwiseOnDemand]: 329/348 looper letters, 42 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-03-17 10:44:30,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 323 transitions, 768 flow [2025-03-17 10:44:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:44:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:44:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2025-03-17 10:44:30,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395593869731801 [2025-03-17 10:44:30,855 INFO L175 Difference]: Start difference. First operand has 328 places, 348 transitions, 724 flow. Second operand 6 states and 1753 transitions. [2025-03-17 10:44:30,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 323 transitions, 768 flow [2025-03-17 10:44:30,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 323 transitions, 762 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 10:44:30,864 INFO L231 Difference]: Finished difference. Result has 320 places, 323 transitions, 678 flow [2025-03-17 10:44:30,864 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-17 10:44:30,865 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-03-17 10:44:30,865 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 323 transitions, 678 flow [2025-03-17 10:44:30,865 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-17 10:44:30,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:30,865 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-17 10:44:30,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:44:30,865 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-17 10:44:30,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash 286059423, now seen corresponding path program 1 times [2025-03-17 10:44:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:30,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465861840] [2025-03-17 10:44:30,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:30,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 10:44:30,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 10:44:30,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:30,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:30,910 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-17 10:44:30,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:30,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465861840] [2025-03-17 10:44:30,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465861840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:30,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:30,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:44:30,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740503219] [2025-03-17 10:44:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:30,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:30,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:30,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:44:30,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 348 [2025-03-17 10:44:30,939 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-17 10:44:30,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:30,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 348 [2025-03-17 10:44:30,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:32,258 INFO L124 PetriNetUnfolderBase]: 2345/13445 cut-off events. [2025-03-17 10:44:32,258 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-17 10:44:32,356 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 356. Compared 161424 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-17 10:44:32,436 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 24 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2025-03-17 10:44:32,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 324 transitions, 734 flow [2025-03-17 10:44:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2025-03-17 10:44:32,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022988505747126 [2025-03-17 10:44:32,438 INFO L175 Difference]: Start difference. First operand has 320 places, 323 transitions, 678 flow. Second operand 3 states and 942 transitions. [2025-03-17 10:44:32,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 324 transitions, 734 flow [2025-03-17 10:44:32,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 324 transitions, 722 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:44:32,446 INFO L231 Difference]: Finished difference. Result has 318 places, 324 transitions, 680 flow [2025-03-17 10:44:32,446 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-17 10:44:32,446 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -10 predicate places. [2025-03-17 10:44:32,446 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 324 transitions, 680 flow [2025-03-17 10:44:32,447 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-17 10:44:32,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:32,447 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-17 10:44:32,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:44:32,447 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-17 10:44:32,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash 304818460, now seen corresponding path program 1 times [2025-03-17 10:44:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744807982] [2025-03-17 10:44:32,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:32,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:44:32,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:44:32,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:32,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:32,502 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-17 10:44:32,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:32,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744807982] [2025-03-17 10:44:32,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744807982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575431188] [2025-03-17 10:44:32,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:32,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:32,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:32,506 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-17 10:44:32,508 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-17 10:44:32,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:44:32,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:44:32,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:32,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:32,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 10:44:32,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:32,605 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-17 10:44:32,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:44:32,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575431188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:32,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:44:32,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-17 10:44:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232940847] [2025-03-17 10:44:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:32,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:44:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:32,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:44:32,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:32,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 348 [2025-03-17 10:44:32,625 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-17 10:44:32,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:32,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 348 [2025-03-17 10:44:32,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:35,819 INFO L124 PetriNetUnfolderBase]: 5494/24147 cut-off events. [2025-03-17 10:44:35,819 INFO L125 PetriNetUnfolderBase]: For 1898/1898 co-relation queries the response was YES. [2025-03-17 10:44:36,031 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 309426 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-17 10:44:36,205 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 41 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-03-17 10:44:36,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 340 transitions, 813 flow [2025-03-17 10:44:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:44:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:44:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2025-03-17 10:44:36,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157088122605364 [2025-03-17 10:44:36,206 INFO L175 Difference]: Start difference. First operand has 318 places, 324 transitions, 680 flow. Second operand 3 states and 956 transitions. [2025-03-17 10:44:36,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 340 transitions, 813 flow [2025-03-17 10:44:36,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 340 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:36,218 INFO L231 Difference]: Finished difference. Result has 320 places, 325 transitions, 690 flow [2025-03-17 10:44:36,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-17 10:44:36,219 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, -8 predicate places. [2025-03-17 10:44:36,219 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 325 transitions, 690 flow [2025-03-17 10:44:36,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-17 10:44:36,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:36,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-17 10:44:36,226 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-17 10:44:36,424 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-17 10:44:36,424 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-17 10:44:36,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1794056116, now seen corresponding path program 1 times [2025-03-17 10:44:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773059907] [2025-03-17 10:44:36,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:36,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:44:36,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:44:36,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:36,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:36,490 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-17 10:44:36,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773059907] [2025-03-17 10:44:36,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773059907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455994536] [2025-03-17 10:44:36,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:36,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:36,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:36,496 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-17 10:44:36,505 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-17 10:44:36,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:44:36,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:44:36,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:36,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:36,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:44:36,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:36,638 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-17 10:44:36,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:36,668 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-17 10:44:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455994536] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:36,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:44:36,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910648608] [2025-03-17 10:44:36,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:36,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:44:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:36,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:44:36,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:44:36,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-03-17 10:44:36,723 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-17 10:44:36,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:36,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-03-17 10:44:36,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:38,851 INFO L124 PetriNetUnfolderBase]: 2346/13479 cut-off events. [2025-03-17 10:44:38,851 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2025-03-17 10:44:38,974 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 161942 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-17 10:44:39,053 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 28 selfloop transitions, 9 changer transitions 0/333 dead transitions. [2025-03-17 10:44:39,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 333 transitions, 782 flow [2025-03-17 10:44:39,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:44:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:44:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2757 transitions. [2025-03-17 10:44:39,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8802681992337165 [2025-03-17 10:44:39,056 INFO L175 Difference]: Start difference. First operand has 320 places, 325 transitions, 690 flow. Second operand 9 states and 2757 transitions. [2025-03-17 10:44:39,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 333 transitions, 782 flow [2025-03-17 10:44:39,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 333 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:39,064 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 738 flow [2025-03-17 10:44:39,064 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-17 10:44:39,064 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 2 predicate places. [2025-03-17 10:44:39,064 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 738 flow [2025-03-17 10:44:39,065 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-17 10:44:39,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:39,065 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-17 10:44:39,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 10:44:39,266 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-17 10:44:39,266 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-17 10:44:39,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash -386549036, now seen corresponding path program 2 times [2025-03-17 10:44:39,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:39,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089198429] [2025-03-17 10:44:39,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:39,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:39,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-17 10:44:39,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 10:44:39,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:39,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:39,406 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-17 10:44:39,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:39,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089198429] [2025-03-17 10:44:39,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089198429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:44:39,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335635197] [2025-03-17 10:44:39,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:44:39,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:44:39,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:44:39,410 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-17 10:44:39,412 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-17 10:44:39,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-17 10:44:39,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 10:44:39,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:44:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:39,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:44:39,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:44:39,611 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-17 10:44:39,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:44:39,720 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-17 10:44:39,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335635197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:44:39,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:44:39,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-17 10:44:39,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896208325] [2025-03-17 10:44:39,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:44:39,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 10:44:39,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:39,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 10:44:39,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:44:39,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 348 [2025-03-17 10:44:39,826 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-17 10:44:39,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:39,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 348 [2025-03-17 10:44:39,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:44:41,825 INFO L124 PetriNetUnfolderBase]: 2346/13518 cut-off events. [2025-03-17 10:44:41,825 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2025-03-17 10:44:41,899 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 162258 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-17 10:44:41,943 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 31 selfloop transitions, 18 changer transitions 0/345 dead transitions. [2025-03-17 10:44:41,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 345 transitions, 910 flow [2025-03-17 10:44:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 10:44:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 10:44:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5488 transitions. [2025-03-17 10:44:41,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876117496807152 [2025-03-17 10:44:41,947 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 738 flow. Second operand 18 states and 5488 transitions. [2025-03-17 10:44:41,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 345 transitions, 910 flow [2025-03-17 10:44:41,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 898 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-17 10:44:41,954 INFO L231 Difference]: Finished difference. Result has 350 places, 341 transitions, 838 flow [2025-03-17 10:44:41,955 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-17 10:44:41,955 INFO L279 CegarLoopForPetriNet]: 328 programPoint places, 22 predicate places. [2025-03-17 10:44:41,955 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 341 transitions, 838 flow [2025-03-17 10:44:41,957 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-17 10:44:41,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:41,957 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-17 10:44:41,964 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-17 10:44:42,161 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-17 10:44:42,161 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-17 10:44:42,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 878123057, now seen corresponding path program 3 times [2025-03-17 10:44:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:42,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045141402] [2025-03-17 10:44:42,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:44:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:42,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 8 equivalence classes. [2025-03-17 10:44:42,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 10:44:42,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:44:42,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:42,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:44:42,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 10:44:42,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 10:44:42,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:42,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:44:42,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:44:42,228 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:44:42,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-17 10:44:42,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-17 10:44:42,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-17 10:44:42,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-17 10:44:42,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-17 10:44:42,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-17 10:44:42,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-17 10:44:42,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:44:42,231 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-03-17 10:44:42,231 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:44:42,231 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-17 10:44:42,270 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:44:42,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 422 transitions, 884 flow [2025-03-17 10:44:42,312 INFO L124 PetriNetUnfolderBase]: 36/465 cut-off events. [2025-03-17 10:44:42,312 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 10:44:42,318 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 1915 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-17 10:44:42,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 422 transitions, 884 flow [2025-03-17 10:44:42,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 422 transitions, 884 flow [2025-03-17 10:44:42,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:44:42,323 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;@7b96f6b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:44:42,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 10:44:42,325 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:44:42,325 INFO L124 PetriNetUnfolderBase]: 0/50 cut-off events. [2025-03-17 10:44:42,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:44:42,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:44:42,326 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-17 10:44:42,326 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-17 10:44:42,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:44:42,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1789499167, now seen corresponding path program 1 times [2025-03-17 10:44:42,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:44:42,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114724718] [2025-03-17 10:44:42,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:44:42,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:44:42,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:44:42,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:44:42,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:44:42,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:44:42,438 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-17 10:44:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:44:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114724718] [2025-03-17 10:44:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114724718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:44:42,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:44:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:44:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618032055] [2025-03-17 10:44:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:44:42,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:44:42,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:44:42,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:44:42,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:44:42,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 422 [2025-03-17 10:44:42,651 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-17 10:44:42,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:44:42,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 422 [2025-03-17 10:44:42,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand